Michael Frazier, Sally Goldman, et al.  Home/Search
Context Related
| uiuc.edu/~pitt/Papers/ignorant.ps 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: uiuc.edu/~pitt/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One view of computational learning theory is that of a learner acquiring the knowledge of a teacher. We introduce a formal model of learning capturing the idea that teachers may have gaps in their knowledge. In particular, we consider learning from a teacher who labels examples "+" (a positive instance of the concept being learned), "\Gamma" (a negative instance of the concept being learned), and "?" (an instance with unknown classification), in such a way that knowledge of the concept... (Update)
Context of citations to this paper: More
.... learning with restricted focus of attention [3, 4] learning probabilistic concepts [9] learning with a consistently ignorant teacher [6] or learning with a constrained instance or projective equivalence oracle [2] In the sequel, we assume that the reader is familiar with...
...adversary instead of a random process, and the rate of incorrect answers that can be tolerated is consequently much lower. Frazier et al. [14] have introduced a model of omissions in answers to membership queries, called learning from a consistently ignorant teacher. The basic...
Cited by: More
Noise-Tolerant Distribution-Free Learning of General.. - Bshouty, Goldman, al. (1996) (Correct)
Exact Learning of Discretized Geometric Concepts - Bshouty, Goldberg, al. (1994) (Correct)
Learning From Examples With Unspecified Attribute Values - Goldman, Kwek (1997) (Correct)
Similar documents (at the sentence level):
6.2%: Learning From a Consistently Ignorant Teacher - Frazier, Goldman, Mishra, Pitt (1994) (Correct)
Active bibliography (related documents): More All
1.2: Minimizing Disagreement for Geometric Regions Using Dynamic.. - Fischer, Kwek (1996) (Correct)
0.8: Learning With Unreliable Boundary Queries - Blum, Chalasani, Goldman, Slonim (1997) (Correct)
0.5: Complexity Theoretic Hardness Results for Query Learning - Aizenstein, Hegedüs.. (1998) (Correct)
Similar documents based on text: More All
0.2: CLASSIC Learning - Frazier, Pitt (1991) (Correct)
0.2: Streaming-Data Algorithms for High-Quality Clustering - O'Callaghan, Mishra.. (2002) (Correct)
0.2: Race-Based Parsing and Syntactic Disambiguation - McRoy, Hirst (1989) (Correct)
Related documents from co-citation: More All
18: Queries and concept learning (context) - Angluin - 1988
14: Learning in the presence of malicious errors - Kearns, Li - 1993
14: Learnability and the Vapnik Chervonenkis Dimension (context) - Blumer, Ehrenfeucht et al. - 1989
BibTeX entry: (Update)
Mike Frazier, Sally Goldman, Nina Mishra, and Leonard Pitt. Learning from a consistently ignorant teacher. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, July 1994. http://citeseer.ist.psu.edu/frazier94learning.html More
@article{ frazier96learning,
author = "Michael Frazier and Sally A. Goldman and Nina Mishra and Leonard Pitt",
title = "Learning from a Consistently Ignorant Teacher",
journal = "Journal of Computer and System Sciences",
volume = "52",
number = "3",
pages = "471-492",
year = "1996",
url = "citeseer.ist.psu.edu/frazier94learning.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
537 A theory of the learnable (context) - Valiant - 1984
465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
441 Queries and concept learning (context) - Angluin - 1988
274 Generalization as search (context) - Mitchell - 1982
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
184 Cryptographic limitations on learning Boolean formulae and f.. - Kearns, Valiant - 1994
142 Learning from noisy examples (context) - Angluin, Laird - 1988
132 Fast probabilistic algorithms for hamiltonian circuits and m.. (context) - Angluin, Valiant - 1979
115 Efficient distribution-free learning of probabilistic concep.. - Kearns, Schapire - 1994
107 Efficient noise-tolerant learning from statistical queries - Kearns - 1993
97 Learning read-once formulas with queries - Angluin, Hellerstein et al. - 1993
94 Learning in the presence of malicious errors - Kearns, Li - 1993
84 Learning conjunctions of Horn clauses - Angluin, Frazier et al. - 1992
81 Equivalence of models for polynomial learnability (context) - Haussler, Kearns et al. - 1991
68 Version Spaces: An Approach to Concept Learning (context) - Mitchell - 1978
67 Negative results for equivalence queries (context) - Angluin - 1990
52 Learning from good and bad data (context) - Laird - 1988
49 functions on randomly drawn points (context) - Haussler, Littlestone et al. - 1994
49 Learning the CLASSIC description logic: Theoretical and expe.. - Cohen, Hirsh - 1994
43 CLASSIC learning - Frazier, Pitt - 1994
42 term DNF formulas with queries (context) - Blum, Rudich et al. - 1992
40 Types of noise in data for concept learning (context) - Sloan - 1988
36 Efficient learning with virtual threshold gates - Maass, Warmuth - 1995
33 Exact learning of read-twice DNF formulas (context) - Aizenstein, Pitt - 1991
28 DNF with Noise in the Attributes (context) - Shackelford, Volper - 1988
28 Exact learning Boolean functions via the monotone theory - Bshouty - 1995
27 term DNF formulas using queries and counterexamples (context) - Angluin - 1987
26 Learning arithmetic read-once formulas (context) - Bshouty, Hancock et al. - 1995
26 Composite geometric concepts and polynomial predictability - Long, Warmuth - 1994
21 Exact identification of circuits using fixed points of ampli.. (context) - Goldman, Kearns et al. - 1993
21 line learning of rectangles (context) - Chen, Maass - 1992
19 On learning from queries and counterexamples in the presence.. (context) - Sakakibara - 1991
19 A noise model on learning sets of strings (context) - Sakakibara, Siromoney - 1992
19 Learning with malicious membership queries and exceptions (context) - Angluin, Krikis - 1994
18 Theoretical underpinnings of version spaces (context) - Hirsh - 1991
17 Learning Boolean read-once formulas with arbitrary symmetric.. (context) - Bshouty, Hancock et al. - 1992
17 Separating distribution-free and mistake-bound learning mode.. (context) - Blum - 1994
16 Learning unions of two rectangles in the plane with equivale.. (context) - Chen - 1993
15 Learning unions of boxes with membership and equivalence que.. - Goldberg, Goldman et al. - 1994
15 Noise-tolerant distribution-free learning of general geometr.. - Bshouty, Goldman et al.
14 The bounded injury priority method and the learnability of u.. - Chen, Homer - 1994
14 On learning discretized geometric concepts (context) - Bshouty, Chen et al. - 1994
13 Generalizing the PAC model for neural net and other learning.. (context) - Haussler - 1989
12 the limits of proper learnability of subclasses of DNF formu.. (context) - Pillaipakkamnatt, Raghavan - 1994
12 Exact learning of discretized geometric concepts - Bshouty, Goldberg et al. - 1994
11 Learning 2-DNF formulas and k decision trees (context) - Hancock - 1991
10 Learning with queries but incomplete information - Sloan, Tur'an - 1994
10 Read-twice DNF formulas are properly learnable (context) - Pillaipakkamnatt, Raghavan - 1995
6 Noise-tolerant parallel learning of geometric concepts - Bshouty, Goldman et al. - 1995
6 Exact learning of -DNF formulas with malicious membership qu.. (context) - Angluin - 1994
5 The common order-theoretic structure of version spaces and a.. - Gunter, Ngair et al. - 1991
3 line prediction of depth two linear threshold circuits (context) - Auer, Kwek et al.
3 Can PAC learning algorithms tolerate random noise (context) - Goldman, Sloan - 1995
2 Polynomial-time learning of intersections of halfspaces (context) - Kwek, Pitt - 1995
1 Learning DNF under the uniform distribution (context) - Jackson - 1994
1 Special issue for the 23rd Annual ACM Symposium on Theory of.. (context) - Angluin, Kharitonov et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-sal.cs.uiuc.edu/~pitt/): More
On Exploiting Knowledge and Concept Use in Learning Theory - Pitt (Correct)
Learning Conjunctions of Horn Clauses - Angluin, Frazier, Pitt (1992) (Correct)
Criteria for Polynomial Time (Conceptual) Clustering - Pitt, Reinke (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