arXiv:2611.25011v1 Announce Type: new
Abstract: The sample compression conjecture is a longstanding open problem in learning theory, originating in the work of Littlestone and Warmuth in the 1980s. At its heart is a connection between simplification and generalization: if a predictor consistent with a training sample is defined using only a small part of that sample, then it is likely to generalize. Sample compression schemes formalize this idea, and many natural learning algorithms can be analyzed this way.
The sample compression conjecture of Floyd and Warmuth (1995) asserts that every binary concept class of VC dimension $d$ admits a sample compression scheme of size $O(d)$; a weaker conjecture asks only for size polynomial in $d$. Both have remained open: the first bound depending only on $d$, due to Moran and Yehudayoff (2016), is exponential in $d$. We prove the weaker conjecture by constructing a sample compression scheme of size $O(d^2 \log^2 d)$.
Trending
- This Is The Best Type Of Wireless Earbuds For Audio Output
- Attention Head Specialization: Phase Transitions in Sample Complexity
- [2611.26264] A Statistical Framework for Training Data Auditing of Large Language Models
- Building Your Own Mini PC Is Harder Than You Would Think
- [2611.26201] Learn, Freeze, and Transfer an Activation Function Across Architectures
- [2611.26235] Physics-Informed Feature Representations and Pretrained Tabular Foundation Models for Generalizable Melt Pool Geometry Prediction
- Invertible Transport Between Sample-Only Distributions via Projected Characteristic Functions
- Six Products And Services Google Discontinued In 2026
