Preference-based teaching

MaRDI QIDQ5361292zbMATH OpenFDO

Authors Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles

Publication date 27 September 2017

Full work available at URL https://arxiv.org/abs/1702.02047, http://jmlr.csail.mit.edu/papers/v18/16-460.html

zbMATH Keywords

learning halfspaceslinear setspreference relationrecursive teaching dimensionteaching dimension

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Preference-based teaching of unions of geometric objects
• Measuring teachability using variants of the teaching dimension
• Combinatorial results on the complexity of teaching and learning
• Recursive teaching dimension, learning complexity, and maximum classes
• Teaching a smarter learner.

Cited in

(7)

• Finitely distinguishable erasing pattern languages
• The teaching size: computable teachers and learners for universal languages
• Distinguishing pattern languages with membership examples
• Preference-based teaching of unions of geometric objects
• When redundancy matters: machine teaching of representations
• Tournaments, Johnson graphs and NC-teaching
• Optimal collusion-free teaching

This page was built for publication: Preference-based teaching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361292)