Recursive teaching dimension, learning complexity, and maximum classes

DOI10.1007/978-3-642-16108-7_19MaRDI QIDQ4930700zbMATH OpenOpenAlexFDO

Authors Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles

Publication date 1 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16108-7_19

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Recommendations

• Recursive teaching dimension, VC-dimension and sample compression
• Sauer's bound for a notion of teaching complexity
• Teaching and Compressing for Low VC-Dimension
• Combinatorial results on the complexity of teaching and learning
• Algebraic methods proving Sauer's bound for teaching complexity

Cited in

(11)

• Teaching and Compressing for Low VC-Dimension
• Sign rank versus Vapnik-Chervonenkis dimension
• Algebraic methods proving Sauer's bound for teaching complexity
• Combinatorial results on the complexity of teaching and learning
• A note on hardness of computing recursive teaching dimension
• Preference-based teaching
• Order compression schemes
• Sauer's bound for a notion of teaching complexity
• Recursive teaching dimension, VC-dimension and sample compression
• On the complexity of teaching
• Labeled compression schemes for extremal classes

This page was built for publication: Recursive teaching dimension, learning complexity, and maximum classes

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