English

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

Probability 2016-06-08 v2 Information Theory math.IT

Abstract

Let AA be an isotropic, sub-gaussian m×nm \times n matrix. We prove that the process Zx:=Ax2mx2Z_x := \|Ax\|_2 - \sqrt m \|x\|_2 has sub-gaussian increments. Using this, we show that for any bounded set TRnT \subseteq \mathbb{R}^n, the deviation of Ax2\|Ax\|_2 around its mean is uniformly bounded by the Gaussian complexity of TT. 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.

Keywords

Cite

@article{arxiv.1603.00897,
  title  = {A simple tool for bounding the deviation of random matrices on geometric sets},
  author = {Christopher Liaw and Abbas Mehrabian and Yaniv Plan and Roman Vershynin},
  journal= {arXiv preprint arXiv:1603.00897},
  year   = {2016}
}

Comments

16 pages. Minor corrections

R2 v1 2026-06-22T13:02:37.198Z