Optimal collusion-free teaching

MaRDI QIDQ7034385zbMATH OpenFDO

Authors David Kirkpatrick, Hans Ulrich Simon, Sandra Zilles

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/kirkpatrick19a.html

zbMATH Keywords

constrained graph matchingsmachine teachingsample compression

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• Compressing and teaching for low VC-dimension
• Inductive inference of formal languages from positive data
• Learning regular languages from simple positive examples
• Measuring teachability using variants of the teaching dimension
• Models of cooperative teaching and learning
• On the complexity of teaching
• On the density of families of sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Optimal collusion-free teaching
• Order compression schemes
• Preference-based teaching
• Recursive teaching dimension, VC-dimension and sample compression
• Sample Compression Schemes for VC Classes
• Teachability in computational learning
• Teaching a smarter learner.
• Unlabeled compression schemes for maximum classes

Cited in

(3)

• Tournaments, Johnson graphs and NC-teaching
• Distinguishing relational pattern languages with a small number of short strings
• Optimal collusion-free teaching

This page was built for publication: Optimal collusion-free teaching

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