General bounds on statistical query learning and PAC learning with noise via hypothesis boosting

Authors:
J. A. Aslam;S. E. Decatur
Affiliations:
Lab. for Comput. Sci., MIT, Cambridge, MA, USA;-
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 3

PAC Learning with Nasty Noise

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
On Using Extended Statistical Queries to Avoid Membership Queries

COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Boosting theory towards practice: recent developments in decision tree induction and the weak learning framework

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.