RIPless compressed sensing from anisotropic measurements

DOI10.1016/j.laa.2013.04.018zbMath1332.94045arXiv1205.1423OpenAlexW2003870284MaRDI QIDQ2437334

Yanyan Li

Publication date: 3 March 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

sparse regressionLASSOcompressed sensing\(\ell_1\) minimizationnon-commutative large deviation estimatesanisotropic ensemblesoperator Bernstein inequalitiesrestricted isometriesthe Dantzig selectorthe golfing scheme

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Convex programming (90C25) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Large deviations (60F10) Sampling theory in information and communication theory (94A20)

Related Items

Modern compressive tomography for quantum information science, Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication, Improved recovery guarantees for phase retrieval from coded diffraction patterns, Extracting Sparse High-Dimensional Dynamics from Limited Data, Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE, Convergence radius and sample complexity of ITKM algorithms for dictionary learning, Low-rank matrix completion in a general non-orthogonal basis, Robust group lasso: model and recoverability, On the Role of Total Variation in Compressed Sensing, A partial derandomization of phaselift using spherical designs

Cites Work

• Unnamed Item
• Unnamed Item
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• A remark on compressed sensing
• Probabilistic methods for algorithmic discrete mathematics
• Simultaneous analysis of Lasso and Dantzig selector
• Exact matrix completion via convex optimization
• Reconstruction From Anisotropic Random Measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Strong converse for identification via quantum channels
• Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
• Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
• A Probabilistic and RIPless Theory of Compressed Sensing
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Compressed sensing