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

preprint2016arXivOpen access

Abstract

Let AA be an isotropic, sub-gaussian m×nm \times n matrix. We prove that the process Zx:=∥Ax∥2−m∥x∥2Z_x := \|Ax\|_2 - \sqrt m \|x\|_2 has sub-gaussian increments. Using this, we show that for any bounded set T⊆RnT \subseteq \mathbb{R}^n, the deviation of ∥Ax∥2\|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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.