Research map / Learning theory and algorithms / Sample complexity
Efficient Testable Learning of Halfspaces with Adversarial Label Noise
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- An Efficient Tester-Learner for Halfspaces (ICLR 2024 · similarity 0.94)
- On the Power of Localized Perceptron for Label-Optimal Learning of Halfspaces with Adversarial Noise (ICML 2021 · similarity 0.92)
- Active Learning of General Halfspaces: Label Queries vs Membership Queries (NeurIPS 2024 · similarity 0.87)
- Reliable Learning of Halfspaces under Gaussian Marginals (NeurIPS 2024 · similarity 0.86)
- Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random (NeurIPS 2024 · similarity 0.86)
- Robust learning of halfspaces under log-concave marginals (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.