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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.