On the Complexity of Teaching (1992)
| Venue: | Journal of Computer and System Sciences |
| Citations: | 83 - 2 self |
BibTeX
@ARTICLE{Goldman92onthe,
author = {Sally A. Goldman and Michael J. Kearns},
title = {On the Complexity of Teaching},
journal = {Journal of Computer and System Sciences},
year = {1992},
volume = {50},
pages = {303--314}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teaching . In this paper we study the complexity of teaching by considering a variant of the on-line learning model in which a helpful teacher selects the instances. We measure the complexity of teaching a concept from a given concept class by a combinatorial measure we call the teaching dimension. Informally, the teaching dimension of a concept class is the minimum number of instances a teacher must reveal to uniquely identify any target concept chosen from the class. A preliminary version of this paper appeared in the Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 303--314. August 1991. Most of this research was carried out while both authors were at MIT Laboratory for Computer Science with support provided by ARO Grant DAAL03-86-K-0171, DARPA Contract N00014-89-J-1988, NSF Gr...
