Optimally compressing VC classes
Machine Learning
2022-01-14 v2 Combinatorics
Abstract
Resolving a conjecture of Littlestone and Warmuth, we show that any concept class of VC-dimension has a sample compression scheme of size .
Cite
@article{arxiv.2201.04131,
title = {Optimally compressing VC classes},
author = {Zachary Chase},
journal= {arXiv preprint arXiv:2201.04131},
year = {2022}
}
Comments
Invalid proof of Proposition 3.2 and thus of main theorem (Theorem 1)