A simple tool for bounding the deviation of random matrices on geometric sets
Skip to main content
eScholarship
Open Access Publications from the University of California

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

  • Author(s): Liaw, C
  • Mehrabian, A
  • Plan, Y
  • Vershynin, R
  • et al.
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.

Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.

Main Content
Current View