Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices

DOI10.1109/TIT.2010.2046199zbMath1366.94130arXiv0806.0604MaRDI QIDQ5281472

Wei Wang, Kannan Ramchandran, Martin J. Wainwright

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Random matrices (probabilistic aspects) (60B20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items (13)

Sparse high-dimensional linear regression. Estimating squared error and a phase transition ⋮ Iterative algorithm for discrete structure recovery ⋮ Compressive Classification: Where Wireless Communications Meets Machine Learning ⋮ A note on the asymptotic distribution of lasso estimator for correlated data ⋮ A novel probabilistic approach for vehicle position prediction in free, partial, and full GPS outages ⋮ Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization ⋮ Which bridge estimator is the best for variable selection? ⋮ Sparse regression: scalable algorithms and empirical performance ⋮ Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference ⋮ Sparse Sensor Placement Optimization for Classification ⋮ Sparse classification: a scalable discrete optimization perspective ⋮ Feature selection for data integration with mixed multiview data ⋮ The all-or-nothing phenomenon in sparse linear regression

This page was built for publication: Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices