Toward efficient agnostic learning

Michael J. Kearns, Robert E. Schapire, Linda M. Sellie
1992 Proceedings of the fifth annual workshop on Computational learning theory - COLT '92  
In this paper we initiate an investigation of generalizations of the Probably Approximately Correct (PAC) learning model that attempt to significantly weaken the target function assumptions. The ultimate goal in this direction is informally termed agnostic learning, in which we make virtually no assumptions on the target function. The name derives from the fact that as designers of learning algorithms, we give up the belief that Nature (as represented by the target function) has a simple or
more » ... inct explanation. We give a number of positive and negative results that provide an initial outline of the possibilities for agnostic learning. Our results include hardness results for the most obvious generalization of the PAC model to an agnostic setting, an efficient and general agnostic learning method based on dynamic programming, relationships between loss functions for agnostic learning, and an algorithm for a learning problem that involves hidden variables.
doi:10.1145/130385.130424 dblp:conf/colt/KearnsSS92 fatcat:ted7tyc22jabdpgxddat53nvuu