On a Combinatorial Problem Arising in Machine Teaching
<|reference_start|>On a Combinatorial Problem Arising in Machine Teaching: We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minimum number of examples needed for any concept, the so-called teaching dimension. A recent paper [7] conjectured that the worst case for this model, as a function of the size of the concept class, occurs when the consistency matrix contains the binary representations of numbers from zero and up. In this paper we prove their conjecture. The result can be seen as a generalization of a theorem resolving the edge isoperimetry problem for hypercubes [12], and our proof is based on a lemma of [10].<|reference_end|>
@article{håvardstun2024on,
    title={On a Combinatorial Problem Arising in Machine Teaching},
    author={Brigt H{aa}vardstun, Jan Kratochv'il, Joakim Sunde, Jan Arne Telle},
    journal={arXiv preprint arXiv:2402.04907},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.04907},
    primaryClass={math.CO cs.LG}
}