Four types of noise in data for PAC learning
From MaRDI portal
Publication:673611
DOI10.1016/0020-0190(95)00016-6zbMath1004.68539OpenAlexW2036478832MaRDI QIDQ673611
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00016-6
Related Items
Learning under \(p\)-tampering poisoning attacks, Learning with unreliable boundary queries, Learning with restricted focus of attention, Improved lower bounds for learning from noisy examples: An information-theoretic approach
Cites Work
- Unnamed Item
- Occam's razor
- Equivalence of models for polynomial learnability
- Can PAC learning algorithms tolerate random attribute noise?
- Learning in the Presence of Malicious Errors
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- Probability Inequalities for Sums of Bounded Random Variables