PAC learning with nasty noise.
From MaRDI portal
Publication:1853516
DOI10.1016/S0304-3975(01)00403-0zbMath1061.68081MaRDI QIDQ1853516
Nader H. Bshouty, Eyal Kushilevitz, Nadav Eiron
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (6)
Learning under \(p\)-tampering poisoning attacks ⋮ Incentive compatible regression learning ⋮ Machine learning in adversarial environments ⋮ Algorithms for strategyproof classification ⋮ Some Recent Results on Local Testing of Sparse Linear Codes ⋮ A model for prejudiced learning in noisy environments
Cites Work
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
- Learning with unreliable boundary queries
- Sharper bounds for Gaussian and empirical processes
- Toward efficient agnostic learning
- On the density of families of sets
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Learning in the Presence of Malicious Errors
- Sample-efficient strategies for learning in the presence of noise
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- Probability Inequalities for Sums of Bounded Random Variables
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: PAC learning with nasty noise.
