Recent developments in algorithmic teaching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5457, Issue , 2009, Pages 1-18

  Balbach, Frank J ^a   Zeugmann, Thomas ^a  

^a Hokkaido University ^*  (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPT CLASS; MEMORY SIZE; TEACHING/LEARNING;

LINGUISTICS; TEACHING; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 67649946689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00982-2_1     Document Type: Conference Paper

References (33)

1. Angluin, D.: Queries and concept learning. Machine Learning 2, 319-342 (1988)
2. Angluin, D.: Queries revisited. Theoret. Comput. Sci. 313, 175-194 (2004)
3. Freivalds, R., Kinber, E.B., Wiehagen, R.: Inductive inference from good examples. In: Jantke, K.P. (ed.) AII 1989. LNCS (LNAI), Vol. 397, pp. 1-17. Springer, Heidelberg (1989)
4. Freivalds, R., Kinber, E.B., Wiehagen, R.: On the power of inductive inference from good examples. Theoret. Comput. Sci. 110, 131-144 (1993) (Pubitemid 23644549)
5. Jain, S., Lange, S., Nessel, J.: On the learnability of recursively enumerable languages from good examples. Theoret. Comput. Sci. 261, 3-29 (2001)
6. Jackson, J., Tomkins, A.: A computational model of teaching. In: Proc. 5th Annual ACM Workshop on Computational Learning Theory, pp. 319-326. ACM Press, New York (1992)
7. Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. J. of Comput. Syst. Sci. 52, 255-267 (1996)
8. Mathias, H.D.: A model of interactive teaching. J. of Comput. Syst. Sci. 54, 487- 501 (1997)
9. Angluin, D., Kriķis, M.: Teachers, learners and black boxes. In: Proceedings of the Tenth Annual Conference on Computational Learning Theory, pp. 285-297. ACM Press, New York (1997)
10. Angluin, D., Kriķis, M.: Learning from different teachers. Machine Learning 51, 137-163 (2003)
11. Goldman, S.A., Rivest, R.L., Schapire, R.E.: Learning binary relations and total orders. SIAM J. Comput. 22, 1006-1034 (1993)
12. Goldman, S.A., Kearns, M.J.: On the complexity of teaching. J. of Comput. Syst. Sci. 50, 20-31 (1995)
13. Shinohara, A., Miyano, S.: Teachability in computational learning. New Generation Computing 8, 337-348 (1991)
14. Balbach, F.J.: Teaching classes with high teaching dimension using few examples. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), Vol. 3559, pp. 668-683. Springer, Heidelberg (2005)
15. Balbach, F.J.: Measuring teachability using variants of the teaching dimension. Theoret. Comput. Sci. 397, 94-113 (2008)
16. Balbach, F.J., Zeugmann, T.: Teaching learners with restricted mind changes. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), Vol. 3734, pp. 474-489. Springer, Heidelberg (2005)
17. Balbach, F.J., Zeugmann, T.: Teaching memoryless randomized learners without feedback. In: Balcázar, J.L., Long, P.M., Stephan, F. (eds.) ALT 2006. LNCS (LNAI), Vol. 4264, pp. 93-108. Springer, Heidelberg (2006) (Pubitemid 44705622)
18. Balbach, F.J., Zeugmann, T.: Teaching randomized learners. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), Vol. 4005, pp. 229-243. Springer, Heidelberg (2006)
19. Natarajan, B.K.: Machine Learning: A Theoretical Approach. Morgan Kaufmann, San Mateo (1991)
20. Kushilevitz, E., Linial, N., Rabinovich, Y., Saks, M.: Witness sets for families of binary vectors. Journal of Combinatorial Theory Series A 73, 376-380 (1996) (Pubitemid 126652139)
21. Anthony, M., Brightwell, G., Cohen, D., Shawe-Taylor, J.: On exact specification by examples. In: Proc. 5th Annual ACM Workshop on Computational Learning Theory, pp. 311-318. ACM Press, New York (1992)
22. Anthony, M., Brightwell, G., Shawe-Taylor, J.: On specifying Boolean functions by labelled examples. Discrete Applied Mathematics 61, 1-25 (1995)
23. Lee, H., Servedio, R.A., Wan, A.: DNF are teachable in the average case. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS, Vol. 4005, pp. 214-228. Springer, Heidelberg (2006) (Pubitemid 44072196)
24. Hegedús, T.: Combinatorial results on the complexity of teaching and learning. In: Privara, I., Ružička, P., Rovan, B. (eds.) MFCS 1994. LNCS, Vol. 841, pp. 393-402. Springer, Heidelberg (1994)
25. Hegedǔs, T.: Generalized teaching dimensions and the query complexity of learning. In: Proc. 8th Annual Conference on Computational Learning Theory, pp. 108- 117. ACM Press, New York (1995)
26. Ben-David, S., Eiron, N.: Self-directed learning and its relation to the VCdimension and to teacher-directed learning. Machine Learning 33, 87-104 (1998) (Pubitemid 128522667)
27. Rivest, R.L., Yin, Y.L.: Being taught can be faster than asking questions. In: Proc. 8th Annual Conference on Computational Learning Theory, pp. 144-151. ACM Press, New York (1995)
28. Kuhlmann, C.: On teaching and learning intersection-closed concept classes. In: Fischer, P., Simon, H.U. (eds.) EuroCOLT 1999. LNCS, Vol. 1572, pp. 168-182. Springer, Heidelberg (1999)
29. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Chichester (1994)
30. Bertsekas, D.P.: Dynamic Programming and Optimal Control. Athena Scientific (2001)
31. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP. In: Proc. of the 29th ACM Symposium on Theory of Computing, pp. 475-484. ACM Press, New York (1997)
32. Feige, U.: A threshold of ln n for approximating set cover. J. of the ACM 45, 634-652 (1998)
33. Zilles, S., Lange, S., Holte, R., Zinkevich, M.: Teaching dimensions based on cooperative learning. In: 21st Annual Conference on Learning Theory - COLT 2008, Helsinki, Finland, pp. 135-146. Omnipress (2008)