Referenced Items are not available for this document.
We derive general bounds on the complexity of learning in the statistical query model and in the PAC model with classification noise. We do so by considering the problem of boosting the accuracy of weak learning algorithms which fall within the statistical query model. This new model was introduced by M. Kearns (1993) to provide a general framework for efficient PAC learning in the presence of classification noise
Published in:
Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
Date of Conference: 3-5 Nov 1993
- Page(s):
- 282 - 291
- Meeting Date :
- 03 Nov 1993-05 Nov 1993
- Print ISBN:
- 0-8186-4370-6
- INSPEC Accession Number:
- 4851331
- Conference Location :
- Palo Alto, CA
- Digital Object Identifier :
- 10.1109/SFCS.1993.366859
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
