Conditional teaching size

M Garcia-Piqueras, J Hernández-Orallo - arXiv preprint arXiv:2107.07038, 2021 - arxiv.org
Recent research in machine teaching has explored the instruction of any concept expressed
in a universal language. In this compositional context, new experimental results have shown …

Optimal teaching curricula with compositional simplicity priors

M Garcia-Piqueras, J Hernández-Orallo - … 13–17, 2021, Proceedings, Part I …, 2021 - Springer
Abstract Machine teaching under strong simplicity priors can teach any concept in universal
languages. Remarkably, recent experiments suggest that the teaching sets are shorter than …

Heuristic search of optimal machine teaching curricula

M Garcia-Piqueras, J Hernández-Orallo - Machine Learning, 2023 - Springer
In curriculum learning the order of concepts is determined by the teacher but not the
examples for each concept, while in machine teaching it is the examples that are chosen by …

[PDF][PDF] Optimal Teaching Curricula with Compositional Simplicity Priors

J Hernández-Orallo - researchgate.net
Machine teaching under strong simplicity priors can teach any concept in universal
languages. Remarkably, recent experiments suggest that the teaching sets are shorter than …

Finite biased teaching with infinite concept classes

J Hernández-Orallo, JA Telle - arXiv preprint arXiv:1804.07121, 2018 - arxiv.org
We investigate the teaching of infinite concept classes through the effect of the learning bias
(which is used by the learner to prefer some concepts over others and by the teacher to …

[PDF][PDF] Complexity of Teaching by a Restricted Number of Examples.

H Kobayashi, A Shinohara - COLT, 2009 - learningtheory.org
Teaching is inextricably linked to learning, and there are many studies on the complexity of
teaching as well as learning in computational learning theory. In this paper, we study the …

[PDF][PDF] No Learner Left Behind: On the Complexity of Teaching Multiple Learners Simultaneously.

X Zhu, J Liu, M Lopes - IJCAI, 2017 - pages.cs.wisc.edu
We present a theoretical study of machine teaching in the setting where the teacher must
use the same training set to teach multiple learners. This problem is a theoretical abstraction …

Measuring teachability using variants of the teaching dimension

FJ Balbach - Theoretical Computer Science, 2008 - Elsevier
In a typical algorithmic learning model, a learner has to identify a target object from partial
information. Conversely, in a teaching model a teacher has to give information that allows …

On batch teaching with sample complexity bounded by vcd

F Mansouri, H Simon, A Singla… - Advances in Neural …, 2022 - proceedings.neurips.cc
In machine teaching, a concept is represented by (and inferred from) a small number of
labeled examples. Various teaching models in the literature cast the interaction between …

Finite and confident teaching in expectation: Sampling from infinite concept classes

J Hernández-Orallo, JA Telle - ECAI 2020, 2020 - ebooks.iospress.nl
We investigate the teaching of infinite concept classes through the effect of the learning prior
(which is used by the learner to derive posteriors giving preference of some concepts over …