Discrepancy, chaining and subgaussian processes

From MaRDI portal
Publication:533745

DOI10.1214/10-AOP575zbMATH Open1226.60011arXiv1104.1508OpenAlexW2032923326MaRDI QIDQ533745FDOQ533745

Shahar Mendelson

Publication date: 6 May 2011

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

Abstract: We show that for a typical coordinate projection of a subgaussian class of functions, the infimum over signs inf(epsiloni)supfinF|sumi=1kepsilonif(Xi)| is asymptotically smaller than the expectation over signs as a function of the dimension k, if the canonical Gaussian process indexed by F is continuous. To that end, we establish a bound on the discrepancy of an arbitrary subset of mathbbRk using properties of the canonical Gaussian process the set indexes, and then obtain quantitative structural information on a typical coordinate projection of a subgaussian class.


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




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Discrepancy, chaining and subgaussian processes

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