General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting
Open Access
- 1 March 1998
- journal article
- Published by Elsevier in Information and Computation
- Vol. 141 (2), 85-118
- https://doi.org/10.1006/inco.1998.2664
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Learning Integer LatticesSIAM Journal on Computing, 1992
- The strength of weak learnabilityMachine Learning, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Learning from noisy examplesMachine Learning, 1988
- A theory of the learnableCommunications of the ACM, 1984
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971