Unlabeled Compression Schemes Exceeding the VC-dimension
Combinatorics
2021-10-15 v2 Discrete Mathematics
Machine Learning
Abstract
In this note we disprove a conjecture of Kuzmin and Warmuth claiming that every family whose VC-dimension is at most d admits an unlabeled compression scheme to a sample of size at most d. We also study the unlabeled compression schemes of the joins of some families and conjecture that these give a larger gap between the VC-dimension and the size of the smallest unlabeled compression scheme for them.
Keywords
Cite
@article{arxiv.1811.12471,
title = {Unlabeled Compression Schemes Exceeding the VC-dimension},
author = {Dömötör Pálvölgyi and Gábor Tardos},
journal= {arXiv preprint arXiv:1811.12471},
year = {2021}
}