Michael Kearns  Home/Search
Context Related
| att.com/~mkearns/paper...malicious.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: jprc.com/Artificial_Intel...index (more) Homepages: M.Kearns |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we study an extension of the distribution-free model of learning introduced by Valiant [23] (also known as the probably approximately correct or PAC model) that allows the presence of malicious errors in the examples given to a learning algorithm. Such errors are generated by an adversary with unbounded computational power and access to the entire history of the learning algorithm's computation. Thus, we study a worst-case model of errors. Our results include general methods for... (Update)
Cited by: More
Learning in the Presence of Malicious Errors - Michael Kearns Att (1993) (Correct)
Decision Trees: More Theoretical Justification for Practical.. - Pechyony (2004) (Correct)
Proceedings of the 26th Annual ACM Symposium on Theory of.. - Extended Michael (Correct)
Similar documents (at the sentence level):
57.0%: of Machine Learning - Michael Kearns The (1994) (Correct)
12.8%: Cryptographic Limitations on Learning Boolean Formulae and.. - Kearns, Valiant (1989) (Correct)
11.7%: Cryptographic Limitations on Learning - Boolean Formulae And (Correct)
Active bibliography (related documents): More All
0.1: Part 1: Overview of the Probably Approximately Correct (PAC).. - Haussler (1995) (Correct)
0.1: Can PAC Learning Algorithms Tolerate Random Attribute Noise? - Sally Goldman (1995) (Correct)
0.1: The Difficulty of Random Attribute Noise - Sally Goldman (1991) (Correct)
Similar documents based on text: More All
0.1: Learning with noise. Extension to regression. - Teytaud (2001) (Correct)
0.1: Efficient Noise-Tolerant Learning From Statistical Queries - Kearns (1993) (Correct)
0.1: Learning Nonoverlapping Perceptron Networks From Examples and .. - Hancock, Golea (1994) (Correct)
Related documents from co-citation: More All
55: Learning from noisy examples (context) - Angluin, Laird - 1988
48: Learnability and the Vapnik Chervonenkis Dimension (context) - Blumer, Ehrenfeucht et al. - 1989
44: Communications of the ACM (context) - Valiant, of et al. - 1984
BibTeX entry: (Update)
Michael Kearns and Ming Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807--837, August 1993. http://citeseer.ist.psu.edu/article/kearns93learning.html More
@inproceedings{ kearns88learning,
author = "Michael Kearns and Ming Li",
title = "Learning in the presence of malicious errors",
pages = "267--280",
year = "1988",
url = "citeseer.ist.psu.edu/article/kearns93learning.html" }
Citations (may not include all citations):4212 Computers and intractability: a guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
537 A theory of the learnable (context) - Valiant - 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
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
273 the strength of weak learnability - Schapire - 1989
245 A measure of asymptotic efficiency for tests of a hypothesis.. (context) - Chernoff - 1952
215 Learning decision lists - Rivest - 1987
151 A general lower bound on the number of examples needed for l.. (context) - Ehrenfeucht, Haussler et al. - 1989
149 Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
142 Learning from noisy examples (context) - Angluin, Laird - 1988
139 A greedy heuristic for the set covering problem (context) - Chvatal - 1979
132 Fast probabilistic algorithms for Hamiltonian circuits and m.. (context) - Angluin, Valiant - 1979
94 Learning in the presence of malicious errors - Kearns, Li - 1988
84 Learning disjunctions of conjunctions (context) - Valiant - 1985
81 Equivalence of models for polynomial learnability (context) - Haussler, Kearns et al. - 1988
78 the learnability of Boolean formulae - Kearns, Li et al. - 1987
74 the ratio of optimal integral and fractional covers (context) - Lovasz - 1975
52 Learning from good and bad data (context) - Laird - 1988
40 Types of noise in data for concept learning (context) - Sloan - 1988
36 A polynomial-time algorithm for learning k-variable pattern .. (context) - Kearns, Pitt - 1989
28 DNF with noise in the attributes (context) - Shackelford, Volper - 1988
2 Learning in an infinite attribute space (context) - Blum - 1990
1 The fastest descent method for covering problems (context) - Nigmatullin - 1969
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cora.jprc.com/Artificial_Intelligence/Machine_Learning/Theory/index.html): More
On the Sample Complexity of Noise-Tolerant Learning - Aslam, Decatur (1996) (Correct)
Knowing What Doesn't Matter: Exploiting The Omission of.. - Greiner, Grove, Kogan (1994) (Correct)
Self Bounding Learning Algorithms - Freund (1998) (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