PAC learning with nasty noise
- 1 October 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 288 (2), 255-275
- https://doi.org/10.1016/s0304-3975(01)00403-0
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- General bounds on statistical query learning and PAC learning with noise via hypothesis boostingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sample-efficient strategies for learning in the presence of noiseJournal of the ACM, 1999
- Combinatorial variability of vapnik-chervonenkis classes with applications to sample compression schemesDiscrete Applied Mathematics, 1998
- A new composition theorem for learning algorithmsPublished by Association for Computing Machinery (ACM) ,1998
- A composition theorem for learning algorithms with applications to geometric concept classesPublished by Association for Computing Machinery (ACM) ,1997
- Noise-tolerant distribution-free learning of general geometric conceptsPublished by Association for Computing Machinery (ACM) ,1996
- Learning in Hybrid Noise Environments Using Statistical QueriesPublished by Springer Nature ,1996
- Learning with unreliable boundary queriesPublished by Association for Computing Machinery (ACM) ,1995
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Learning from noisy examplesMachine Learning, 1988