Teaching dimensions based on cooperative learning

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 135-146

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

^a UNIVERSITY OF ALBERTA   (Canada)

^b DARMSTADT UNIVERSITY OF APPLIED SCIENCES   (Germany)

^c YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPT CLASS; COOPERATIVE LEARNING; NON-MONOTONICITY; NONMONOTONIC; OPTIMAL CHOICE; PROCESS OF LEARNING; SAMPLE SIZES; TEACHING AND LEARNING;

SAMPLING;

EID: 67649974615     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. M. Anthony, G. Brightwell, DA. 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.
2. D. Angluin and M. Krikis. 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.
3. F. Balbach. Measuring teachability using variants of the teaching dimension. Theoret. Comput. Sci., 397(1-3): 94-113, 2008.
4. 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.
5. 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.
6. S.A. Goldman and M.J. Kearns. On the complexity of teaching. J. Comput. Syst. Sci., 50(1): 20-31, 1995.
7. S.A. Goldman and H.D. Mathias. Teaching a smarter learner. J. Comput. Syst. Sci., 52(2): 255-267, 1996.
8. 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.
9. T. Hegedüs. 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.
10. 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.
11. S. Lange, J. Nessel, and R. Wiehagen. Learning recursive languages from good examples. Ann. Math. Artif. Intell., 23(1-2): 27-52, 1998.
12. H.D. Mathias. A model of interactive teaching. J. Comput. Syst. Sci., 54(3): 487-501, 1997.
13. Matthias Ott and Frank Stephan. Avoiding coding tricks by hyperrobust learning. Theoret. Comput. Sci., 284(1): 161-180, 2002.
14. 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.
15. A. Shinohara and S. Miyano. Teachability in computational learning. New Generation Comput., 8(4): 337-348, 1991.
16. L.G. Valiant. A theory of the learnable. Commun. ACM, 27(11): 1134-1142, 1984.