Sally A. Goldman, H. David Mathias  Home/Search
Context Related
| indiana.edu/l/www/hyplan...teach1.ps.gz 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: indiana.edu/l/www/hyplan/dmath (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a formal model of teaching in which the teacher is tailored to a particular learner, yet the teaching protocol is designed so that no collusion is possible. Not surprisingly, such a model remedies the non-intuitive aspects of other models in which the teacher must successfully teach any consistent learner. We prove that any class that can be exactly identified by a deterministic polynomial-time algorithm with access to a very rich set of example-based queries is teachable by... (Update)
Cited by: More
Grammatical Inference and First Language Acquisition - Alexander Clark Asc (Correct)
Grammatical Inference and the Argument from the Poverty of the.. - Clark (2004) (Correct)
Learning DFA from Simple Examples - Rajesh Parekh Rpare (1997) (Correct)
Similar documents (at the sentence level):
63.8%: Teaching a Smarter Learner - Goldman, Mathias (1993) (Correct)
Active bibliography (related documents): More All
1.0: A Model of Interactive Teaching - Mathias (1997) (Correct)
0.7: An Interactive Model of Teaching - Mathias (1995) (Correct)
0.5: On the Complexity of Teaching - Goldman, Kearns (1992) (Correct)
Similar documents based on text: More All
0.2: Extending Intelligent Learning Environments with.. - Biswas.. (2001) (Correct)
0.1: PAC Learning under Helpful Distributions - Denis, Gilleron (1997) (Correct)
0.1: Teachable Agents: Combining Insights from Learning .. - Brophy, Biswas.. (1999) (Correct)
Related documents from co-citation: More All
9: Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1989
8: A theory of the learnable (context) - Valiant - 1984
8: Queries and concept learning (context) - Angluin - 1988
BibTeX entry: (Update)
Control, 37:302--320. Goldman, S. and Mathias, D. (1993). Teaching a smarter learner. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pages 67--76. http://citeseer.ist.psu.edu/goldman94teaching.html More
@article{ goldman96teaching,
author = "Sally A. Goldman and H. David Mathias",
title = "Teaching a Smarter Learner",
journal = "Journal of Computer and System Sciences",
volume = "52",
number = "2",
pages = "255-267",
year = "1996",
url = "citeseer.ist.psu.edu/goldman94teaching.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
441 Queries and concept learning (context) - Angluin - 1988
215 Learning decision lists - Rivest - 1987
115 the density of families of sets (context) - Sauer - 1972
88 The knowledge complexity of interactive proofs (context) - Goldwasser, Goldwasser et al. - 1985
84 Learning when irrelevant attributes abound: A new linear-thr.. (context) - Littlestone - 1988
84 Learning conjunctions of Horn clauses - Angluin, Frazier et al. - 1992
74 Exact learning via the monotone theory (context) - Bshouty - 1993
61 Polynomial-time inference of arbitrary pattern languages (context) - Lange, Wiehagen - 1991
40 Lower bound methods and separation results for on-line learn.. (context) - Maass, Tur'an - 1992
29 Learning nested differences of intersection-closed concept c.. (context) - Helmbold, Sloan et al. - 1990
28 the prediction of general recursive functions (context) - Barzdin, Freivald - 1972
25 Generalization as search (context) - Mitchell - 1982
25 On learning Boolean functions (context) - Natarajan - 1987
25 the complexity of teaching - Goldman, Kearns - 1991
22 Read-thrice DNF is hard to learn with membership and equival.. (context) - Aizenstein, Hellerstein et al. - 1992
19 A computational model of teaching - Jackson, Tomkins - 1992
19 Teachability in computational learning (context) - Shinohara, Miyano - 1991
18 Learning binary relations and total orders - Goldman, Rivest et al. - 1993
17 Learning with a helpful teacher (context) - Salzberg, Delcher et al. - 1991
14 On exact specification by examples (context) - Anthony, Brightwell et al. - 1992
12 On Space-bounded Learning and the Vapnik-Chervonenkis Dimens.. (context) - Floyd - 1989
9 Approximate testing and learnability (context) - Romanik - 1992
9 The power of self-directed learning - Goldman, Sloan - 1992
8 Department of Computer Science (context) - Romanik, Smith et al. - 1990
5 Complete range spaces (context) - Welzl - 1987
3 Theoretical Computer Science (context) - Freivalds, Kinber et al. - 1993
3 Matters Horn and Other Features in the Computational Learnin.. (context) - Frazier - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://grouchy.cs.indiana.edu/l/www/hyplan/dmath.html): More
Exact Learning of Discretized Geometric Concepts - Bshouty, Goldberg, al. (1996) (Correct)
In Support of Teaching: An Empirical Study (Extended Abstract) - Mathias (Correct)
Noise-Tolerant Distribution-Free Learning of General.. - Bshouty, Goldman.. (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