Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds

DOI10.1109/TIT.2013.2253852zbMath1364.94250OpenAlexW2091482891MaRDI QIDQ2989186

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

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

Related Items (5)

Sparse high-dimensional linear regression. Estimating squared error and a phase transition ⋮ Compressive Classification: Where Wireless Communications Meets Machine Learning ⋮ Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization ⋮ Which bridge estimator is the best for variable selection? ⋮ The all-or-nothing phenomenon in sparse linear regression

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