Models of cooperative teaching and learning

Journal of Machine Learning Research

Volumn 12, Issue , 2011, Pages 349-384

  Zilles, Sandra ^a   Lange, Steffen ^b   Holte, Robert ^c   Zinkevich, Martin ^d  

^a UNIVERSITY OF REGINA   (Canada)

^b DARMSTADT UNIVERSITY OF APPLIED SCIENCES   (Germany)

^c UNIVERSITY OF ALBERTA   (Canada)

^d YAHOO INC   (United States)

Author keywords

Collusion; Interactive learning; Learning boolean functions; Teaching dimension

Indexed keywords

COLLUSION; CONCEPT CLASS; INTERACTIVE LEARNING; LEARNING BOOLEAN FUNCTIONS; LEARNING PROCESS; MODELS OF LEARNING; MODELS OF TEACHING; NON-MONOTONICITY; NONMONOTONIC; SAMPLE COMPLEXITY; SPEED-UPS; SUPERVISED MACHINE LEARNING; TARGET CONCEPT; TEACHING AND LEARNING; TRAINING EXAMPLE;

BOOLEAN FUNCTIONS; LEARNING SYSTEMS; PERSONNEL TRAINING;

TEACHING;

EID: 79952757070     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. D. Angluin and M. Kriķis. Teachers, learners and black boxes. In Proc. of the 10th Annual Conference on Computational Learning Theory (COLT'97), pages 285-297. ACM, New York, 1997.
2. D. Angluin and M. Krikis. Learning from different teachers. Mach. Learn., 51:137-163, 2003.
3. M. Anthony, G. Brightwell, D. A. Cohen, and J. Shawe-Taylor. On exact specification by examples. In Proc. of 5th Annual Workshop on Computational Learning Theory (COLT'92), pages, 311-318. ACM, New York, 1992. (Pubitemid 23615451)
4. F. Balbach. Measuring teachability using variants of the teaching dimension. Theoret. Comput. Sci., 397 (1-3): 94-113, 2008.
5. F. Balbach and T. Zeugmann. Recent developments in algorithmic teaching. In Proc. 3rd Intl. Conf. on Language and Automata Theory and Applications, pages 1-18, 2009.
6. S. Ben-David and N. Eiron. Self-directed learning and its relation to the VC-dimension and to teacher-directed learning. Machine Learning, 33(1):87-104, 1998. (Pubitemid 128522667)
7. T. Doliwa, H. U. Simon, and S. Zilles. Recursive teaching dimension, learning complexity, and maximum classes. In Proc. of the 21st International Conference on Algorithmic Learning Theory (ALT'10), volume 6331 of Lecture Notes in Artificial Intelligence, pages 209-223. Springer, 2010.
8. R. Freivalds, E. B. Kinber, and R. Wiehagen. On the power of inductive inference from good examples. Theoret. Comput. Sci., 110(1):131-144, 1993.
9. S. Goldman and M. Kearns. On the complexity of teaching. In Proc. of the 4th Annual Workshop on Computational Learning Theory, COLT'91, pages 303-314. Morgan Kaufmann, 1991.
10. S. A. Goldman and M. J. Kearns. On the complexity of teaching. J. Comput. Syst. Sci., 50(1):20-31, 1995.
11. S. A. Goldman and H. D. Mathias. Teaching a smarter learner. J. Comput. Syst. Sci., 52(2):255-267, 1996. (Pubitemid 126375139)
12. S. Hanneke. Teaching dimension and the complexity of active learning. In Proc. of the 20th Annual Conference on Learning Theory (COLT 2007), pages 66-81. LNCS 4539, Springer, Berlin, 2007.
13. T. Hegedus. Generalized teaching dimensions and the query complexity of learning. In Proc. of the 8th Annual Conference on Computational Learning Theory (COLT'95), pages 108-117. ACM, New York, 1995.
14. J. Jackson and A. Tomkins. A computational model of teaching. In Proc. of 5th Annual Workshop on Computational Learning Theory (COLT'92), pages 319-326. ACM, New York, 1992.
15. H. Kobayashi and A. Shinohara. Complexity of teaching by a restricted number of examples. In Proc. of the 22nd Annual Conference on Learning Theory, COLT'09, pages 293-302, 2009.
16. S. Lange, J. Nessel, and R. Wiehagen. Learning recursive languages from good examples. Ann. Math. Artif. Intell., 23 (1-2): 27-52, 1998.
17. H. D. Mathias. A model of interactive teaching. J. Comput. Syst. Sci., 54(3):487-501, 1997. (Pubitemid 127433388)
18. M. Ott and F. Stephan. Avoiding coding tricks by hyperrobust learning. Theoret. Comput. Sci., 284(1):161-180, 2002. (Pubitemid 34661533)
19. R. L. Rivest and Y. L. Yin. Being taught can be faster than asking questions. In Proc. of the 8th Annual Conference on Computational Learning Theory (COLT'95), pages 144-151. ACM, New York, 1995.
20. R. A. Servedio. On the limits of efficient teachability. Inf. Process. Lett., 79(6):267-272, 2001. (Pubitemid 32771123)
21. A. Shinohara and S. Miyano. Teachability in computational learning. New Generation Comput., 8(4):337-348, 1991.
22. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.
23. S. Zilles, S. Lange, R. Holte, and M. Zinkevich. Teaching dimensions based on cooperative learning. In Proc. of the 21st Annual Conference on Learning Theory (COLT'08), pages 135-146. Omnipress, 2008.