2000 character limit reached
Invertibility of random submatrices via tail decoupling and a Matrix Chernoff Inequality
Published 15 Mar 2011 in math.PR, math.ST, and stat.TH | (1103.3063v3)
Abstract: Let $X$ be a $n\times p$ matrix with coherence $\mu(X)=\max_{j\neq j'} |X_jtX_{j'}|$. We present a simplified and improved study of the quasi-isometry property for most submatrices of $X$ obtained by uniform column sampling. Our results depend on $\mu(X)$, $|X|$ and the dimensions with explicit constants, which improve the previously known values by a large factor. The analysis relies on a tail decoupling argument, of independent interest, and a recent version of the Non-Commutative Chernoff inequality (NCCI).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.