Teaching a smarter learner

Journal of Computer and System Sciences

Volumn 52, Issue 2, 1996, Pages 255-267

  Goldman, Sally A ^a   Mathias, H David ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; COMPUTER SIMULATION; DECISION THEORY; EQUIVALENCE CLASSES; LEARNING ALGORITHMS;

EQUIVALENCE QUERIES; POLYNOMIAL TIME ALGORITHM;

LEARNING SYSTEMS;

EID: 0030129918     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0020     Document Type: Article

References (32)

1. H. Aizenstein, L. Hellerstein, and L. Pitt, Read-thrice DNF is hard to learn with membership and equivalence queries, in "33rd Annual Symposium on Foundations of Computer Science, October 1992," pp. 523-532.
2. D. Angluin, M. Frazier, and L. Pitt, Learning conjunctions of Horn clauses, Mach. Learning 9 (1992), 147-164.
3. D. Angluin, Queries and concept learning, Mach. Learning 2, No. 4 (1988), 319-342.
4. M. Anthony, G. Brightwell, D. Cohen, and J. Shawe-Taylor, On exact specification by examples, in "Proceedings Fifth Annual Workshop on Computational Learning Theory, July 1992," pp. 311-318, Assoc. Comput. Mach., New York, 1992.
5. J. Barzdin and R. Freivalds, On the prediction of general recursive functions, Soviet Math. Dokl. 13 (1972), 1224-1228.
6. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36, No. 4 (1989) 929-965.
7. N. Bshouty, Exact learning via the monotone theory, in "34th Annual Symposium on Foundations of Computer Science, November 1993."
8. S. Floyd, "On Space-bounded Learning and the Vapnik-Chervonenkis Dimension," Ph.D. thesis, International Computer Science Institute, December 1989.
9. M. Frazier, "Matters Horn and Other Features in the Computational Learning Theory Landscape: The Notion of Membership," Ph.D. thesis, University of Illinois, Urbana-Champaign, April 1994.
10. R. Freivalds, E. Kinber, and R. Wiehagen, Inference from good examples, Theoret. Comput. Sci. 110 (1993), 131-144.
11. S. A. Goldman and M. J. Kearns, On the complexity of teaching, in "Proceedings 4th Annual Workshop on Comput. Learning Theory," pp. 303-314, Morgan Kaufmann, San Mateo, CA, 1991; J. Comput. System Sci. 50 (1995), 20-31.
12. S. A. Goldman and M. J. Kearns, On the complexity of teaching, in "Proceedings 4th Annual Workshop on Comput. Learning Theory," pp. 303-314, Morgan Kaufmann, San Mateo, CA, 1991; J. Comput. System Sci. 50 (1995), 20-31.
13. S. A. Goldman, R. L. Rivest, and R. E. Schapire, Learning binary relations and total orders, SIAM J. Comput. 22, No. 5 (1993), 1006-1034.
14. S. A. Goldman and R. H. Sloan, "The Power of Self-directed Learning," Technical Report WUCS-92-49, Washington University, Department of Computer Science, November 1992; Much. Learning, to appear.
15. S. A. Goldman and R. H. Sloan, "The Power of Self-directed Learning," Technical Report WUCS-92-49, Washington University, Department of Computer Science, November 1992; Much. Learning, to appear.
16. S. Goldwasser, S. Goldwasser, and C. Rackoff, The knowledge complexity of interactive proofs, "26th Annual Symposium on Foundations of Computer Science, October 1985," pp. 291-304.
17. D. Helmbold, R. Sloan, and M. K. Warmuth, Learning nested differences of intersection-closed concept classes, Mach. Learning 5 (1990), 165-196, (special issue for COLT 89.)
18. J. Jackson and A. Tomkins, A computational model of teaching, in "Proceedings Fifth Annual Workshop on Computational Learning Theory," pp. 319-326, ACM Press, New York, July 1992.
19. S. Lange and R. Wiehagen, Polynomial-time inference of arbitrary pattern languages, New Generation Comput. 8 (1991), 361-370.
20. N. Littlestone, Learning when irrelevant attributes abound: A new linear-threshold algorithm, Mach. Learning 2 (1988), 285-318.
21. W. Maass and G. Turán, Lower bound methods and separation results for on-line learning models, Mach. Learning 9 (1992), 107-145.
22. T. M. Mitchell, Generalization as search, Artif. Intell. 18, No. 2 (1982), 203-226.
23. B. K. Natarajan, On learning Boolean functions, in "Proceedings Nineteenth Annual ACM Symposium on Theory of Computing, May 1987," pp. 296-304.
24. R. L. Rivest, Learning decision lists, Mach. Learning 2, No. 3 (1987), 229-246.
25. K. Romanik, Approximate testing and learnability, in "Proceedings Fifth Annual Workshop on Computational Learning Theory," pp. 327-332, ACM Press, New York, July 1992.
26. K. Romanik and C. Smith, "Testing Geometric Objects," Technical Report UMIACS-TR-90-69, University of Maryland College Park, Department of Computer Science, 1990.
27. S. Salzberg, A. Delcher, D. Heath, and S. Kasif, Learning with a helpful teacher, in "12th International Joint Conference on Artificial Intelligence, August 1991," pp. 705-711.
28. N. Sauer, On the density of families of sets, J. Combin. Theory Ser. A 13 (1972), 145-147.
29. A. Shinohara and S. Miyano, Teachability in computational learning, New Generation Comput. 8 (1991), 337-347.
30. L. Valiant, A theory of the learnable, Commun. ACM 27, No. 11 (1984), 1134-1142.
31. V. N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264-280.
32. E. Welzl, Complete range spaces, unpublished manuscript, 1987.