Recent Developments in Algorithmic Teaching
The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled.
Starting from the observation that the teaching dimension model sometimes leads to counterintuitive results, recently developed approaches are presented. Here, main emphasis is put on the following aspects derived from human teaching/learning behavior: the order in which examples are presented should matter; teaching should become harder when the memory size of the learners decreases; teaching should become easier if the learners provide feedback; and it should be possible to teach infinite concepts and/or finite and infinite concept classes.
Recent developments in the algorithmic teaching achieving (some) of these aspects are presented and compared.
Unable to display preview. Download preview PDF.
- 19.Natarajan, B.K.: Machine Learning: A Theoretical Approach. Morgan Kaufmann, San Mateo (1991)Google Scholar
- 30.Bertsekas, D.P.: Dynamic Programming and Optimal Control. Athena Scientific (2001)Google Scholar
- 31.Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant 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)Google Scholar
- 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)Google Scholar