Cover Image

Efficient Algorithms for Learning Monophonic Halfspaces in Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bressan, Marco, Esposito, Emmanuel, Thiessen, Maximilian
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
by: Bressan, Marco, et al.
Published: (2025)

Learning Conditional Averages
by: Bressan, Marco, et al.
Published: (2026)

A Theory of Interpretable Approximations
by: Bressan, Marco, et al.
Published: (2024)

Of Dice and Games: A Theory of Generalized Boosting
by: Bressan, Marco, et al.
Published: (2024)

Self-Directed Learning of Convex Labelings on Graphs
by: Sokolov, Georgy, et al.
Published: (2024)

Attribute-Efficient PAC Learning of Sparse Halfspaces with Constant Malicious Noise Rate
by: Zeng, Shiwei, et al.
Published: (2025)

Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate
by: Shen, Jie
Published: (2024)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach
by: Li, Yinan, et al.
Published: (2023)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
by: Klivans, Adam R., et al.
Published: (2024)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
by: Chandrasekaran, Gautam, et al.
Published: (2025)

Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces
by: Blondal, Ari, et al.
Published: (2025)

A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2025)

Replicable Learning of Large-Margin Halfspaces
by: Kalavasis, Alkis, et al.
Published: (2024)

Smoothed Agnostic Learning of Halfspaces over the Hypercube
by: Kou, Yiwen, et al.
Published: (2025)

Reliable Learning of Halfspaces under Gaussian Marginals
by: Diakonikolas, Ilias, et al.
Published: (2024)

Actively Learning Halfspaces without Synthetic Data
by: Black, Hadley, et al.
Published: (2025)

Online Learning of Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

Active Learning of General Halfspaces: Label Queries vs Membership Queries
by: Diakonikolas, Ilias, et al.
Published: (2024)

Improved Hardness Results for Learning Intersections of Halfspaces
by: Tiegel, Stefan
Published: (2024)

Testable Learning of General Halfspaces under Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2026)

Near-Optimal Cryptographic Hardness of Learning With Homogeneous Halfspaces Under Gaussian Marginals
by: Huang, Jizhou, et al.
Published: (2026)

Personalized Prediction By Learning Halfspace Reference Classes Under Well-Behaved Distribution
by: Huang, Jizhou, et al.
Published: (2025)

Learning Intersections of Two Margin Halfspaces under Factorizable Distributions
by: Diakonikolas, Ilias, et al.
Published: (2025)

SwiftF0: Fast and Accurate Monophonic Pitch Detection
by: Nieradzik, Lars
Published: (2025)

A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces
by: Sinen, Tim
Published: (2026)

When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses
by: Moulin, Antoine, et al.
Published: (2025)

Distribution-Specific Agnostic Conditional Classification With Halfspaces
by: Huang, Jizhou, et al.
Published: (2025)

Tight Generalization Bounds for Large-Margin Halfspaces
by: Larsen, Kasper Green, et al.
Published: (2025)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
by: Chandrasekaran, Gautam, et al.
Published: (2025)

A Fine-Grained Understanding of Uniform Convergence for Halfspaces
by: Kontorovich, Aryeh, et al.
Published: (2026)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
by: Qiu, Hao, et al.
Published: (2025)

Lightweight Self-Supervised Detection of Fundamental Frequency and Accurate Probability of Voicing in Monophonic Music
by: Bitra, Venkat Suprabath, et al.
Published: (2026)

An Approximation Algorithm for Graph Label Selection
by: John, Josia, et al.
Published: (2026)

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
by: Qiu, Hao, et al.
Published: (2026)

Partitioned Least Squares
by: Esposito, Roberto, et al.
Published: (2020)

Bandits with Abstention under Expert Advice
by: Pasteris, Stephen, et al.
Published: (2024)

On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks
by: Su, Junwei, et al.
Published: (2025)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
by: Fiandri, Marco, et al.
Published: (2024)