mlsanityData to 14 Oct 2026

Improving Generalization Bounds for VC Classes Using the Hypergeometric Tail Inversion

arXiv 2111.00062 ↗First posted 29 Oct 2021cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We significantly improve the generalization bounds for VC classes by using two main ideas. First, we consider the hypergeometric tail inversion to obtain a very tight non-uniform distribution-independent risk upper bound for VC classes. Second, we optimize the ghost sample trick to obtain a further non-negligible gain. These improvements are then used to derive a relative deviation bound, a multiclass margin bound, as well as a lower bound. Numerical comparisons show that the new bound is nearly never vacuous, and is tighter than other VC bounds for all reasonable data set sizes.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 43 references that are in the map. First posted on arXiv 29 Oct 2021.

Builds on

9 of 43 references.

References · 9

  1. 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
  2. 2015Sample compression schemes for VC classescited by 47
  3. 2015Fast rates in statistical and online learningcited by 47
  4. 2013Relative Deviation Learning Bounds and Generalization with Unbounded Loss Functionscited by 15
  5. 2020Decision trees as partitioning machines to characterize their generalization propertiescited by 12
  6. 2016Exact Lower Bounds for the Agnostic Probably-Approximately-Correct (PAC) Machine Learning Modelcited by 8
  7. 2013Tight Lower Bound on the Probability of a Binomial Exceeding its Expectationcited by 7
  8. 2018Unlabeled Compression Schemes Exceeding the VC-dimensioncited by 6
  9. 2017An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectationcited by 2

Built on by

Not cited yet.