Michael Kearns  Home/Search
Context Related
| upenn.edu/~mkearns/pa...sqjournal.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~mkearns/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we study the extension of Valiant's learning model [32] in which the positive or negative classification label provided with each random example may be corrupted by random noise. This extension was first examined in the learning theory literature by Angluin and Laird [1], who formalized the simplest type of white label noise and then sought algorithms tolerating the highest possible rate of noise. In addition to being the subject of a number of theoretical studies [1, 22, 31, 17],... (Update)
Similar documents based on text: More All
0.3: Efficient Noise-Tolerant Learning From Statistical Queries - Kearns (1993) (Correct)
0.3: Specification and Simulation of Statistical Query Algorithms.. - Javed Aslam (1995) (Correct)
0.1: Rigorous Learning Curve Bounds from Statistical Mechanics - Haussler, Kearns, Seung.. (1996) (Correct)
BibTeX entry: (Update)
Kearns, M. (1993). Efficient noise-tolerant learning from statistical queries. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 392--401. http://citeseer.ist.psu.edu/kearns98efficient.html More
@inproceedings{ kearns93efficient,
author = "Michael Kearns",
title = "Efficient noise-tolerant learning from statistical queries",
pages = "392--401",
year = "1993",
url = "citeseer.ist.psu.edu/kearns98efficient.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Ya et al. - 1971
248 An Introduction to Computational Learning Theory (context) - Kearns, Vazirani - 1994
221 Perceptrons: An Introduction to Computational Geometry (context) - Minsky, Papert - 1988
215 Learning decision lists - Rivest - 1987
151 A general lower bound on the number of examples needed for l.. (context) - Ehrenfeucht, Haussler et al. - 1988
149 Quantifying inductive bias: AI learning algorithms and Valia.. (context) - Haussler - 1988
144 Computational limitations on learning from examples (context) - Pitt, Valiant - 1988
142 Learning from noisy examples (context) - Angluin, Laird - 1988
115 Efficient distribution-free learning of probabilistic concep.. - Kearns, Schapire - 1990
94 Learning in the presence of malicious errors - Kearns, Li - 1988
84 Learning disjunctions of conjunctions (context) - Valiant - 1985
78 the learnability of Boolean formulae - Kearns, Li et al. - 1987
66 Constant depth circuits (context) - Linial, Mansour et al. - 1989
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~mkearns/): More
Graphical Economics - Sham Kakade Michael (Correct)
Efficient Algorithms for Learning to Play Repeated Games Against.. - al. (1995) (Correct)
On the Boosting Ability of Top-Down Decision Tree Learning.. - Kearns (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC