Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
From MaRDI portal
Publication:427066
DOI10.1016/j.acha.2011.09.003zbMath1264.94083OpenAlexW1533470540MaRDI QIDQ427066
Jalal Fadili, Charles Dossal, Marie-Line Chabanol, Gabriel Peyré
Publication date: 13 June 2012
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2011.09.003
consistencycompressed sensingbasis pursuit denoising\(\ell _{1}\)-minimizationsparsistencysparsity pattern recovery
Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items (5)
Sensitivity Analysis for Mirror-Stratifiable Convex Functions ⋮ \( \mathcal{G} \)-LIME: statistical learning for local interpretations of deep neural networks using global priors ⋮ Consistency of \(\ell_1\) recovery from noisy deterministic measurements ⋮ Improved bounds for restricted isometry constants ⋮ Low Complexity Regularization of Linear Inverse Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Some sharp performance bounds for least squares regression with \(L_1\) regularization
- Near-ideal model selection by \(\ell _{1}\) minimization
- High-dimensional variable selection
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint
- A universality result for the smallest eigenvalues of certain sample covariance matrices
- Lasso-type recovery of sparse representations for high-dimensional data
- Least angle regression. (With discussion)
- On the asymptotic properties of the group lasso estimator for linear models
- On the conditions used to prove oracle results for the Lasso
- Norms of random submatrices and sparse approximation
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- High-dimensional graphs and variable selection with the Lasso
- Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- An EM algorithm for wavelet-based image restoration
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Pushing the Limits of Contemporary Statistics: Contributions in Honor of Jayanta K. Ghosh
- Atomic Decomposition by Basis Pursuit
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Necessary and Sufficient Conditions for Sparsity Pattern Recovery
- Compressed and Privacy-Sensitive Sparse Regression
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Shannon-Theoretic Limits on Noisy Compressive Sampling
- Nearly Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery
- Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements
- Information Theoretic Bounds for Compressed Sensing
- Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
- Probability Inequalities for Sums of Bounded Random Variables
- Model Selection and Estimation in Regression with Grouped Variables
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Signal Recovery by Proximal Forward-Backward Splitting
- Computer Vision - ECCV 2004
- Compressed sensing
- Sparse Image and Signal Processing
This page was built for publication: Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
