Toward efficient agnostic learning (1992)
Cached
Download Links
- [www.cs.princeton.edu:80]
- [www.cs.princeton.edu]
- [www.research.att.com]
- [www.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory |
| Citations: | 169 - 7 self |
BibTeX
@INPROCEEDINGS{Kearns92towardefficient,
author = {Michael J. Kearns and Robert E. Schapire and Linda M. Sellie and Lisa Hellerstein},
title = {Toward efficient agnostic learning},
booktitle = {In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory},
year = {1992},
pages = {341--352}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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 succinct 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.
