Uniform Approximation and Bracketing Properties of VC classes

07/23/2010
by   Terrence M. Adams, et al.
0

We show that the sets in a family with finite VC dimension can be uniformly approximated within a given error by a finite partition. Immediate corollaries include the fact that VC classes have finite bracketing numbers, satisfy uniform laws of averages under strong dependence, and exhibit uniform mixing. Our results are based on recent work concerning uniform laws of averages for VC classes under ergodic sampling.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2010

Uniform Approximation of Vapnik-Chervonenkis Classes

For any family of measurable sets in a probability space, we show that e...
research
01/22/2021

Adversarial Laws of Large Numbers and Optimal Regret in Online Classification

Laws of large numbers guarantee that given a large enough sample from so...
research
09/09/2022

Strong uniform laws of large numbers for bootstrap means and other randomly weighted sums

This article establishes novel strong uniform laws of large numbers for ...
research
04/28/2023

Generalization for slowly mixing processes

A bound uniform over various loss-classes is given for data generated by...
research
07/01/2020

Equational Reasoning for MTL Type Classes

Ability to use definitions occurring in the code directly in equational ...
research
11/12/2019

On uniform boundedness of sequential social learning

In the classical herding model, asymptotic learning refers to situations...
research
09/29/2019

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids

The present note is a strengthening of a recent paper by K. Takazawa and...

Please sign up or login with your details

Forgot password? Click here to reset