Machine teaching: An inverse problem to machine learning and an approach toward optimal education

Proceedings of the National Conference on Artificial Intelligence

Volumn 6, Issue , 2015, Pages 4083-4087

  Zhu, Xiaojin ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INVERSE PROBLEMS; LEARNING ALGORITHMS; PERSONNEL TRAINING;

COMPUTER SCIENTISTS; CRITICAL THINKING; DIALOGUE STYLE; OPTIMAL TRAINING; TARGET MODEL;

LEARNING SYSTEMS;

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

References (36)

1. Angluin, D., and Krikis, M. 1997. Teachers, learners and black boxes. In COLT, 285-297. ACM.
2. Angluin, D., and Krikis, M. 2003. Learning from different teachers. Machine Learning 51(2):137-163.
3. Angluin, D. 2004. Queries revisited. Theoretical Computer Science 313(2):175-194.
4. Bach, F. 2013. Learning with submodular functions: A convex optimization perspective. Foundations and Trends in Machine Learning 6(2-3):145-373.
5. Balbach, F. J., and Zeugmann, T. 2006. Teaching randomized learners. In COLT, 229-243. Springer.
6. Balbach, F. J., and Zeugmann, T. 2009. Recent developments in algorithmic teaching. In The 3rd Intl. Conf. on Language and Automata Theory and Applications, 1-18.
7. Balbach, F. J. 2008. Measuring teachability using variants of the teaching dimension. Theor. Comput. Sci. 397(1-3):94-113.
8. Ben-David, S., and Eiron, N. 1998. Self-directed learning and its relation to the vc-dimension and to teacher-directed learning. Machine Learning 33(1):87-104.
9. Bengio, Y.; Louradour, J.; Collobert, R.; and Weston, J. 2009. Curriculum learning. In ICML.
10. Cakmak, M., and Lopes, M. 2012. Algorithmic and human teaching of sequential decision tasks. In AAAI.
11. Doliwa, T; Fan, G.; Simon, H. U.; and Zilles, S. 2014. Recursive teaching dimension, VC-dimension and sample compression. JMLR 15:3107-3131.
12. Feige, U. 1998. A threshold of In n for approximating set cover. J. ACM 45(4):634-652.
13. Goldman, S., and Kearns, M. 1995. On the complexity of teaching. Journal of Computer and Systems Sciences 50(1):20-31.
14. Goldman, S., and Mathias, H. 1996. Teaching a smarter learner. Journal of Computer and Systems Sciences 52(2):255-267.
15. Iyer, R. K., and Bilmes, J. A. 2013. Submodular optimization with submodular cover and submodular knapsack constraints. In NIPS.
16. Khan, F.; Zhu, X.; and Mutlu, B. 2011. How do humans teach: On curriculum learning and teaching dimension. In NIPS.
17. Kobayashi, H., and Shinohara, A. 2009. Complexity of teaching by a restricted number of examples. In COLT.
18. Koedinger, K. R.; Brunskill, E.; de Baker, R. S. J.; McLaughlin, E. A.; and Stamper, J. C. 2013. New potentials for data-driven intelligent tutoring system development and optimization. AI Magazine 34(3):27-41.
19. Krause, A., and Golovin, D. 2014. Submodular function maximization. In Tractability: Practical Approaches to Hard Problems (to appear). Cambridge University Press.
20. Krause, A., and Guestrin, C. 2005. Near-optimal value of information in graphical models. In UAL
21. Kumar, M. P.; Packer, B.; and Roller, D. 2010. Self-paced learning for latent variable models. In NIPS.
22. Lee, Y. J., and Grauman, K. 2011. Learning the easy things first: Self-paced visual category discovery. In CVPR.
23. Lindsey, R.; Mozer, M.; Huggins, W. J.; and Pashler, H. 2013. Optimizing instructional policies. In NIPS.
24. Mathias, H. D. 1997. A model of interactive teaching. J. Comput. Syst. Sci. 54(3):487-501.
25. McCandliss, B. D.; Fiez, J. A.; Protopapas, A.; Conway, M.; and McClelland, J. L. 2002. Success and failure in teaching the [r]-[l] contrast to Japanese adults: Tests of a Hebbian model of plasticity and stabilization in spoken language perception. Cognitive, Affective, & Behavioral Neuroscience 2(2):89-108.
26. Mei, S., and Zhu, X. 2015. Using machine teaching to identify optimal training-set attacks on machine learners. In AAAI.
27. Nemhauser, G. L.; Wolsey, L. A.; and Fisher, M. L. 1978. An analysis of approximations for maximizing submodular set functionsI. Mathematical Programming 14(1):265-294.
28. Pashler, H., and Mozer, M. C. 2013. When does fading enhance perceptual category learning? Journal of Experimental Psychology: Learning, Memory, and Cognition.
29. Patil, K.; Zhu, X.; Kopec, L.; and Love, B. 2014. Optimal teaching for limited-capacity human learners. In NIPS.
30. Rafferty, A. N., and Griffiths, T. L. 2010. Optimal language learning: The importance of starting representative. 32nd Annual Conference of the Cognitive Science Society.
31. Rivest, R. L., and Yin, Y. L. 1995. Being taught can be faster than asking questions. In COLT, 144-151. ACM.
32. Settles, B. 2012. Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool.
33. Shinohara, A., and Miyano, S. 1991. Teachability in computational learning. New Generation Computing 8(4):337-348.
34. Tenenbaum, J. B., and Griffiths, T. L. 2001. The rational basis of representativeness. 23rd Annual Conference of the Cognitive Science Society.
35. Zhu, X. 2013. Machine teaching for Bayesian learners in the exponential family. In NIPS.
36. Zilles, S.; Lange, S.; Holte, R.; and Zinkevich, M. 2011. Models of cooperative teaching and learning. JMLR 12:349-384.