Tail Bounds on the Spectral Norm of Sub-Exponential Random Matrices
Abstract
Let X be an n× n symmetric random matrix with independent but non-identically distributed entries. The deviation inequalities of the spectral norm of X with Gaussian entries have been obtained by using the standard concentration of Gaussian measure results. This paper establishes an upper tail bound of the spectral norm of X with sub-Exponential entries. Our method relies upon a crucial ingredient of a novel chaining argument that essentially involves both the particular structure of the sets used for the chaining and the distribution of coordinates of a point on the unit sphere.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.