Upper bound for intermediate singular values of random matrices
Abstract
In this paper, we prove that an n× n matrix A with independent centered subgaussian entries satisfies \[ sn+1-l(A) C1t ln \] with probability at least 1-(-C2tl). This yields sn-l(A) cln in combination with a known lower bound. These results can be generalized to the rectangular matrix case.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.