Uniform convergence of Vapnik-Chervonenkis classes under ergodic sampling

From MaRDI portal
Publication:989178

DOI10.1214/09-AOP511zbMATH Open1220.60019arXiv1010.3162OpenAlexW3103988912WikidataQ105584253 ScholiaQ105584253MaRDI QIDQ989178FDOQ989178


Authors: T. M. Adams, Andrew B. Nobel Edit this on Wikidata


Publication date: 30 August 2010

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We show that if mathcalX is a complete separable metric space and mathcalC is a countable family of Borel subsets of mathcalX with finite VC dimension, then, for every stationary ergodic process with values in mathcalX, the relative frequencies of sets CinmathcalC converge uniformly to their limiting probabilities. Beyond ergodicity, no assumptions are imposed on the sampling process, and no regularity conditions are imposed on the elements of mathcalC. The result extends existing work of Vapnik and Chervonenkis, among others, who have studied uniform convergence for i.i.d. and strongly mixing processes. Our method of proof is new and direct: it does not rely on symmetrization techniques, probability inequalities or mixing conditions. The uniform convergence of relative frequencies for VC-major and VC-graph classes of functions under ergodic sampling is established as a corollary of the basic result for sets.


Full work available at URL: https://arxiv.org/abs/1010.3162




Recommendations




Cites Work


Cited In (19)





This page was built for publication: Uniform convergence of Vapnik-Chervonenkis classes under ergodic sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989178)