Unlabeled Compression Schemes Exceeding the VC-dimension
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2018
- DOI:
- 10.48550/arXiv.1811.12471
- arXiv:
- arXiv:1811.12471
- Bibcode:
- 2018arXiv181112471P
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Discrete Mathematics;
- Computer Science - Machine Learning