Learnability with respect to fixed distributions
- 1 September 1991
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 86 (2) , 377-389
- https://doi.org/10.1016/0304-3975(91)90026-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Learning from noisy examplesMachine Learning, 1988
- Occam's RazorInformation Processing Letters, 1987
- A theory of the learnableCommunications of the ACM, 1984
- Deductive learningPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1984
- 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