A simple tool for bounding the deviation of random matrices on geometric sets
Probability
2016-06-08 v2 Information Theory
math.IT
Abstract
Let be an isotropic, sub-gaussian matrix. We prove that the process has sub-gaussian increments. Using this, we show that for any bounded set , the deviation of around its mean is uniformly bounded by the Gaussian complexity of . 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.
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