Skip to content
conftrace_

halfspace learning

39 papers

Papers

Actively Learning Halfspaces without Synthetic Data COLT 2026 Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift COLT 2026 Active Classification with Few Queries under Misspecification NeurIPS 2024 Active Learning of General Halfspaces: Label Queries vs Membership Queries NeurIPS 2024 An Efficient Tester-Learner for Halfspaces ICLR 2024 On the sample complexity of privately learning half-spaces ACML 2024 Reliable Learning of Halfspaces under Gaussian Marginals NeurIPS 2024 Testable Learning of General Halfspaces with Adversarial Label Noise COLT 2024 Contrastive Moments: Unsupervised Halfspace Learning in Polynomial Time NeurIPS 2023 Multitask Learning via Shared Features: Algorithms and Hardness COLT 2023 Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise NeurIPS 2023 SLaM: Student-Label Mixing for Distillation with Unlabeled Examples NeurIPS 2023 Agnostic Learnability of Halfspaces via Logistic Loss ICML 2022 Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent ICML 2022 Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise COLT 2022 On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data ACML 2022 Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise COLT 2022 Agnostic Learning of Halfspaces with Gradient Descent via Soft Margins ICML 2021 Forster Decomposition and Learning Halfspaces with Noise NeurIPS 2021 Near Optimal Distributed Learning of Halfspaces with Two Parties COLT 2021 Robust and Private Learning of Halfspaces AISTATS 2021 A Nearly Optimal Variant of the Perceptron Algorithm for the Uniform Distribution on the Unit Sphere COLT 2020 Efficiently Learning Adversarially Robust Halfspaces with Noise ICML 2020 Learning Halfspaces with Massart Noise Under Structured Distributions COLT 2020 Non-Convex SGD Learns Halfspaces with Adversarial Label Noise NeurIPS 2020