Statistical active learning algorithms for noise tolerance and differential privacy
From MaRDI portal
Publication:2345952
DOI10.1007/s00453-014-9954-9zbMath1315.68202arXiv1307.3102OpenAlexW2047836642MaRDI QIDQ2345952
Maria-Florina Balcan, Vitaly Feldman
Publication date: 21 May 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3102
active learningdifferential privacycomputationally efficient algorithmsrandom classification noisestatistical query framework
Related Items (3)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ The Limitations of Optimization from Samples ⋮ On the Power of Learning from k-Wise Queries
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning noisy linear classifiers via adaptive and selective sampling
- A complete characterization of statistical query learning with applications to evolvability
- A polynomial-time algorithm for learning noisy linear threshold functions
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance
- Selective sampling using the query by committee algorithm
- The true sample complexity of active learning
- Agnostic active learning
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- What Can We Learn Privately?
- Efficient noise-tolerant learning from statistical queries
- The Power of Localization for Efficiently Learning Linear Separators with Noise
- Theory of Classification: a Survey of Some Recent Advances
- The geometry of logconcave functions and sampling algorithms
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- 10.1162/153244302760200669
- Theory of Disagreement-Based Active Learning
- Minimax Bounds for Active Learning
- Margin Based Active Learning
- Teaching Dimension and the Complexity of Active Learning
- Statistical algorithms and a lower bound for detecting planted cliques
- Theory of Cryptography
- A simple polynomial-time rescaling algorithm for solving linear programs
This page was built for publication: Statistical active learning algorithms for noise tolerance and differential privacy