Nearly Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery

DOI10.1109/TIT.2011.2145670MaRDI QIDQ5273563zbMATH OpenFDO

Authors Kamiar Rahnama Rad

Publication date 12 July 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2011.2145670

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Linear regression; mixed models (62J05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(11)

• The all-or-nothing phenomenon in sparse linear regression
• Sparse high-dimensional linear regression. Estimating squared error and a phase transition
• Iterative algorithm for discrete structure recovery
• Which bridge estimator is the best for variable selection?
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
• Perfect Recovery Conditions for Non-negative Sparse Modeling
• A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
• What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?
• Variable selection, monotone likelihood ratio and group sparsity
• Numerical characterization of support recovery in sparse regression with correlated design
• High-dimensional variable selection with heterogeneous signals: a precise asymptotic perspective

This page was built for publication: Nearly Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery

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