Tail estimates for norms of sums of log-concave random vectors
Rados{\l}aw Adamczak, Rafa{\l} Lata{\l}a, Alexander E. Litvak, Alain, Pajor, Nicole Tomczak-Jaegermann

TL;DR
This paper develops new tail estimates for norms of sums and projections of log-concave random vectors, with applications to matrix operator norms and the Restricted Isometry Property in Compressive Sensing.
Contribution
It introduces novel tail bounds for projections and sums of log-concave vectors, extending to matrix norms and advancing understanding of the Restricted Isometry Property.
Findings
Established tail estimates for Euclidean norms of projections of log-concave vectors
Derived bounds for operator norms of sub-matrices in log-concave ensembles
Applied results to analyze the Restricted Isometry Property in Compressive Sensing
Abstract
We establish new tail estimates for order statistics and for the Euclidean norms of projections of an isotropic log-concave random vector. More generally, we prove tail estimates for the norms of projections of sums of independent log-concave random vectors, and uniform versions of these in the form of tail estimates for operator norms of matrices and their sub-matrices in the setting of a log-concave ensemble. This is used to study a quantity that controls uniformly the operator norm of the sub-matrices with rows and columns of a matrix with independent isotropic log-concave random rows. We apply our tail estimates of to the study of Restricted Isometry Property that plays a major role in the Compressive Sensing theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Random Matrices and Applications · Statistical Methods and Inference
