General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Boosting a Weak Learning Algorithm by MajorityInformation and Computation, 1995
- On the Sample Complexity of Weak LearningInformation and Computation, 1995
- Efficient noise-tolerant learning from statistical queriesPublished by Association for Computing Machinery (ACM) ,1993
- General bounds on the number of examples needed for learning probabilistic conceptsPublished by Association for Computing Machinery (ACM) ,1993
- An improved boosting algorithm and its implications on learning complexityPublished by Association for Computing Machinery (ACM) ,1992
- Learning Integer LatticesSIAM Journal on Computing, 1992
- The strength of weak learnabilityMachine Learning, 1990
- A general lower bound on the number of examples needed for learningInformation and Computation, 1989
- Learning from Good and Bad DataPublished by Springer Nature ,1988
- A theory of the learnableCommunications of the ACM, 1984