pith. sign in

arxiv: 1603.00897 · v2 · pith:EB5P7QFZnew · submitted 2016-03-02 · 🧮 math.PR · cs.IT· math.IT

A simple tool for bounding the deviation of random matrices on geometric sets

classification 🧮 math.PR cs.ITmath.IT
keywords boundeddeviationmodelprovesetssub-gaussianallowsapplications
0
0 comments X
read the original abstract

Let $A$ be an isotropic, sub-gaussian $m \times n$ matrix. We prove that the process $Z_x := \|Ax\|_2 - \sqrt m \|x\|_2$ has sub-gaussian increments. Using this, we show that for any bounded set $T \subseteq \mathbb{R}^n$, the deviation of $\|Ax\|_2$ around its mean is uniformly bounded by the Gaussian complexity of $T$. We also prove a local version of this theorem, which allows for unbounded sets. These theorems have various applications, some of which are reviewed in this paper. In particular, we give a new result regarding model selection in the constrained linear model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.