A general lower bound on the number of examples needed for learning
- 1 September 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 82 (3) , 247-261
- https://doi.org/10.1016/0890-5401(89)90002-3
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Quantifying inductive bias: AI learning algorithms and Valiant's learning frameworkArtificial Intelligence, 1988
- Occam's RazorInformation Processing Letters, 1987
- A theory of the learnableCommunications of the ACM, 1984
- Some special vapnik-chervonenkis classesDiscrete Mathematics, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952