License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06111.13
URN: urn:nbn:de:0030-drops-6203
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/620/
|
Go to the corresponding Portal |
Balbach, Frank J. ;
Zeugmann, Thomas
On the Teachability of Randomized Learners
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:DagSemProc.06111.13,
author = {Balbach, Frank J. and Zeugmann, Thomas},
title = {{On the Teachability of Randomized Learners}},
booktitle = {Complexity of Boolean Functions},
pages = {1--20},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/620},
URN = {urn:nbn:de:0030-drops-6203},
doi = {10.4230/DagSemProc.06111.13},
annote = {Keywords: Algorithmic Teaching, Complexity of teaching}
}
|
Keywords: |
|
Algorithmic Teaching, Complexity of teaching |
|
Collection: |
|
06111 - Complexity of Boolean Functions |
|
Issue Date: |
|
2006 |
|
Date of publication: |
|
30.11.2006 |
