Imagen de Portada

Actively Learning Halfspaces without Synthetic Data

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Black, Hadley, Larsen, Kasper Green, Mazumdar, Arya, Saha, Barna, So, Geelon
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Learning Partitions with Optimal Query and Round Complexities
por: Black, Hadley, et al.
Publicado: (2025)

Clustering with Non-adaptive Subset Queries
por: Black, Hadley, et al.
Publicado: (2024)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
por: Black, Hadley, et al.
Publicado: (2025)

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

Learning with Monotone Adversarial Corruptions
por: Larsen, Kasper Green, et al.
Publicado: (2026)

The Many Faces of Optimal Weak-to-Strong Learning
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2024)

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

Revisiting Agnostic PAC Learning
por: Hanneke, Steve, et al.
Publicado: (2024)

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

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions
por: Black, Hadley
Publicado: (2023)

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

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

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

Improved Margin Generalization Bounds for Voting Classifiers
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2025)

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

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

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

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

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
por: Matsumoto, Namiko, et al.
Publicado: (2025)

The Sample Complexity of Replicable Realizable PAC Learning
por: Larsen, Kasper Green, et al.
Publicado: (2026)

AdaBoost is not an Optimal Weak to Strong Learner
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)

Derandomizing Multi-Distribution Learning
por: Larsen, Kasper Green, et al.
Publicado: (2024)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
por: Grønlund, Allan, et al.
Publicado: (2024)

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
por: Matsumoto, Namiko, et al.
Publicado: (2022)

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

The I/O Complexity of Attention, or How Optimal is Flash Attention?
por: Saha, Barna, et al.
Publicado: (2024)

Random Subgraph Detection Using Queries
por: Huleihel, Wasim, et al.
Publicado: (2021)

A $d^{1/2+o(1)}$ Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids
por: Black, Hadley, et al.
Publicado: (2023)

Active Learning with Simple Questions
por: Kontonis, Vasilis, et al.
Publicado: (2024)

Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries
por: Black, Hadley, et al.
Publicado: (2025)

A Competitive Algorithm for Agnostic Active Learning
por: Price, Eric, et al.
Publicado: (2023)

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
por: Chen, Peng, et al.
Publicado: (2025)

Learning Functions of Halfspaces
por: Alman, Josh, et al.
Publicado: (2026)

Hardness of Dynamic Tree Edit Distance and Friends
por: Hu, Bingbing, et al.
Publicado: (2025)

Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
por: Peng, Pan, et al.
Publicado: (2025)

Learning-Augmented Search Data Structures
por: Fu, Chunkai, et al.
Publicado: (2024)

Near-optimal Active Regression of Single-Index Models
por: Li, Yi, et al.
Publicado: (2025)

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
por: Larsen, Kasper Green, et al.
Publicado: (2023)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
por: Axiotis, Kyriakos, et al.
Publicado: (2024)