Tail bounds via generic chaining

100Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

Abstract

We modify Talagrand’s generic chaining method to obtain upper bounds for all p-th moments of the supremum of a stochastic process. These bounds lead to an estimate for the upper tail of the supremum with optimal deviation parameters. We use our procedure to improve and extend some known deviation inequalities for suprema of unbounded empirical processes and chaos processes. As an application we give a simplified proof of the restricted isometry property of the subsampled discrete Fourier transform.

Cite

CITATION STYLE

APA

Dirksen, S. (2015). Tail bounds via generic chaining. Electronic Journal of Probability, 20, 1–29. https://doi.org/10.1214/EJP.v20-3760

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free