Invertibility of random submatrices via tail-decoupling and a matrix Chernoff inequality

DOI10.1016/j.spl.2012.03.038zbMath1246.15034arXiv1103.3063OpenAlexW2963472969MaRDI QIDQ449436

Stéphane Chrétien, Sébastien Darses

Publication date: 30 August 2012

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.3063

zbMATH Keywords

decouplingcompressed sensingmatrix Chernoff inequalityrandom sub-matrices

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52)

Related Items (6)

Block Kaczmarz method with inequalities ⋮ Remote sensing via \(\ell_1\)-minimization ⋮ Paved with good intentions: analysis of a randomized block Kaczmarz method ⋮ Randomized block Kaczmarz method with projection for solving least squares ⋮ Pivotal estimation via square-root lasso in nonparametric regression ⋮ Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation

Cites Work

• Unnamed Item
• User-friendly tail bounds for sums of random matrices
• Near-ideal model selection by \(\ell _{1}\) minimization
• Uniform uncertainty principle for Bernoulli and subgaussian ensembles
• Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
• Random vectors in the isotropic position
• Norms of random submatrices and sparse approximation
• Sampling from large matrices

This page was built for publication: Invertibility of random submatrices via tail-decoupling and a matrix Chernoff inequality