On the sample complexity of noise-tolerant learning
- 1 February 1996
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 57 (4) , 189-195
- https://doi.org/10.1016/0020-0190(96)00006-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A general lower bound on the number of examples needed for learningInformation and Computation, 1989
- Learning from noisy examplesMachine Learning, 1988
- Learning from Good and Bad DataPublished by Springer Nature ,1988
- A theory of the learnableCommunications of the ACM, 1984
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952