Source: Information & Computation Vol. 209, No. 3, 2011, 296 - 319.
Abstract. The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of the learner's memory size and of the presence or absence of feedback. Moreover, in the new model the order in which examples are presented may influence the teaching process.
The resulting models are related to Markov decision processes, and characterizations of optimal teachers for memoryless learners with feedback and for learners with infinite memory and feedback are shown.
Furthermore, in the new model it is possible to investigate new aspects of teaching like teaching from positive data only or teaching with inconsistent teachers. Characterization theorems for teachability from positive data for both ordinary teachers and inconsistent teachers with and without feedback are provided.
Keywords: Algorithmic teaching; Randomized algorithms; Computational complexity
This research was done at the Institute for Theoretical
Computer Science, University Lübeck, Germany
©Copyright 2011, Elsevier Inc.