License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6203
URL: http://drops.dagstuhl.de/opus/volltexte/2006/620/
Go to the corresponding Portal


Balbach, Frank J. ; Zeugmann, Thomas

On the Teachability of Randomized Learners

pdf-format:
Document 1.pdf (268 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{balbach_et_al:DSP:2006:620,
  author =	{Frank J. Balbach and Thomas Zeugmann},
  title =	{On the Teachability of Randomized Learners},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/620},
  annote =	{Keywords: Algorithmic Teaching, Complexity of teaching}
}

Keywords: Algorithmic Teaching, Complexity of teaching
Seminar: 06111 - Complexity of Boolean Functions
Issue Date: 2006
Date of publication: 30.11.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI