The Power of Localization for Efficiently Learning Linear Separators with Noise

DOI10.1145/3006384zbMath1426.68234arXiv1307.8371OpenAlexW2620857485MaRDI QIDQ3177877

Philip M. Long, Pranjal Awasthi, Maria-Florina Balcan

Publication date: 2 August 2018

Published in: Journal of the ACM, Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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 $Re^d$ under isotropic log-concave distributions that can tolerate a nearly information-theoretically optimal noise rate of $eta = Omega(epsilon)$. 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 $eta$, we also give a polynomial-time algorithm for learning linear separators in $Re^d$ under isotropic log-concave distributions that can handle a noise rate of $eta = Omegaleft(epsilon ight)$. We show that, in the active learning model, our algorithms achieve a label complexity whose dependence on the error parameter $epsilon$ is polylogarithmic. This provides the first polynomial-time active learning algorithm for learning linear separators in the presence of malicious noise or adversarial label noise.

Full work available at URL: https://arxiv.org/abs/1307.8371

zbMATH Keywords

learning theorylocalizationagnostic learningactive learninglinear classificationnoise-tolerant learningmalicious noiseadversarial label noisepassive and active learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography

Related Items (13)

Stronger data poisoning attacks break data sanitization defenses ⋮ Learning from binary labels with instance-dependent noise ⋮ Active learning by query by committee with robust divergences ⋮ Unnamed Item ⋮ Learning under \(p\)-tampering poisoning attacks ⋮ Unnamed Item ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Active Nearest-Neighbor Learning in Metric Spaces ⋮ Testing distributional assumptions of learning algorithms ⋮ Learning with a Drifting Target Concept ⋮ Unnamed Item ⋮ Statistical active learning algorithms for noise tolerance and differential privacy ⋮ Agnostically Learning Boolean Functions with Finite Polynomial Representation

Uses Software

• SuLQ

This page was built for publication: The Power of Localization for Efficiently Learning Linear Separators with Noise