betaFeedback

WorksComputer Science

Near-Quadratic Sample Compression for All VC Classes

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 dd admits a sample compression scheme of size O(d)O(d); a weaker conjecture asks only for size polynomial in dd. Both have remained open: the first bound depending only on dd, due to Moran and Yehudayoff (2016), is exponential in dd. We prove the weaker conjecture by constructing a sample compression scheme of size O(d2log⁡2d)O(d^2 \log^2 d).

Paper details

vlnc:W_j43ccb9a
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Cogentic multi-agent orchestration

View statement
Looking for related papers…