Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds

DOI10.1109/TIT.2013.2253852MaRDI QIDQ2989186zbMATH OpenOpenAlexFDO

Authors Galen Reeves, Michael C. Gastpar

Publication date 8 June 2017

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

Full work available at URL https://doi.org/10.1109/tit.2013.2253852

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Cited in

(10)

• The all-or-nothing phenomenon in sparse linear regression
• Sparse high-dimensional linear regression. Estimating squared error and a phase transition
• Which bridge estimator is the best for variable selection?
• Compressive classification: where wireless communications meets machine learning
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
• An Information-Theoretic Study for Joint Sparsity Pattern Recovery With Different Sensing Matrices
• Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
• What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?
• Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
• Unsourced random access

This page was built for publication: Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989186)