The Power of Localization for Efficiently Learning Linear Separators with Noise
Pranjal Awasthi, Maria Florina Balcan, Philip M. Long

TL;DR
This paper presents new noise-tolerant algorithms for efficiently learning linear separators in high-dimensional spaces, achieving near-optimal noise robustness and polylogarithmic label complexity in active learning scenarios.
Contribution
It introduces the first polynomial-time algorithms for learning linear separators under malicious and adversarial label noise with improved noise tolerance guarantees.
Findings
Algorithms tolerate nearly optimal noise rates of () in both noise models.
Achieves polylogarithmic label complexity in active learning for noisy linear separators.
Provides the first polynomial-time active learning algorithms under malicious and adversarial noise.
Abstract
We introduce a new approach for designing computationally efficient learning algorithms that are tolerant to noise, and demonstrate its effectiveness by designing algorithms with improved noise tolerance guarantees for learning linear separators. We consider both the malicious noise model and the adversarial label noise model. For malicious noise, where the adversary can corrupt both the label and the features, we provide a polynomial-time algorithm for learning linear separators in under isotropic log-concave distributions that can tolerate a nearly information-theoretically optimal noise rate of . For the adversarial label noise model, where the distribution over the feature vectors is unchanged, and the overall probability of a noisy label is constrained to be at most , we also give a polynomial-time algorithm for learning linear separators in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
