2026-07-19T22:13:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:620 2024-03-06T11:06:46Z ddc:004 open_access

On the Teachability of Randomized Learners Balbach, Frank J. Zeugmann, Thomas Algorithmic Teaching Complexity of teaching The present paper introduces a new model for teaching {em randomized learners}. Our new model, though based on the classical teaching dimension model, allows to study the influence of various parameters such as the learner's memory size, its ability to provide or to not provide feedback, and the influence of the order in which examples are presented. Furthermore, within the new model it is possible to investigate new aspects of teaching like teaching from positive data only or teaching with inconsistent teachers. Furthermore, we provide characterization theorems for teachability from positive data for both ordinary teachers and inconsistent teachers with and without feedback. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Frank J. Balbach and Thomas Zeugmann 2006 Is Part Of Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06111.13 urn:nbn:de:0030-drops-6203 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.13 eng https://creativecommons.org/licenses/by/4.0/legalcode