AI & ML
Near-Quadratic Sample Compression for All VC Classes
arXiv stat.ML0 views
arXiv:2611.25011v1 Announce Type: cross 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)$.
Source:https://arxiv.org/abs/2611.25011PreviousA Model of Diverse Sampling from Language ModelsNextHapBO: Harnessed $\alpha$-$\pi$ Bayesian Optimization via Expert Natural Language Priors
Related posts
VESTA: Visual Exploration with Statistical Tool Agents
0arXiv stat.CO
An interpretable semiparametric Bayesian machine learning model for high-dimensional circulating epigenetic signatures of multiple myeloma
0arXiv stat.CO
Quantum Nondecimated Wavelet Transform: Theory, Circuits, and Applications
0arXiv stat.CO
dapper: Data Augmentation for Private Posterior Estimation in R
0arXiv stat.CO
HAVAPlot: A Web-Based Scientific Visualization and Post-Processing Platform
0arXiv stat.CO
ISC Stormcast For Friday, November 20th, 2026 https://isc.sans.edu/podcastdetail/10188, (Fri, Nov 20th)
0SANS ISC