Asymptotic Analysis of LASSOs Solution Path with Implications for Approximate Message Passing
arXiv:1309.5979
Abstract
This paper concerns the performance of the LASSO (also knows as basis pursuit denoising) for recovering sparse signals from undersampled, randomized, noisy measurements. We consider the recovery of the signal from random and noisy linear observations , where is the measurement matrix and is the noise. The LASSO estimate is given by the solution to the optimization problem with . Despite major progress in the theoretical analysis of the LASSO solution, little is known about its behavior as a function of the regularization parameter . In this paper we study two questions in the asymptotic setting (i.e., where , while the ratio converges to a fixed number in ): (i) How does the size of the active set behave as a function of , and (ii) How does the mean square error behave as a function of ? We then employ these results in a new, reliable algorithm for solving LASSO based on approximate message passing (AMP).
References in corpus (4)
Cited by in corpus (8)
- ICR: Iterative Convex Refinement for Sparse Signal Recovery Using Spike and Slab Priors
- Parameterless Optimal Approximate Message Passing
- A scalable estimate of the extra-sample prediction error via approximate leave-one-out
- False Discoveries Occur Early on the Lasso Path
- Does -minimization outperform -minimization?
- Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals
- Consistent Risk Estimation in Moderately High-Dimensional Linear Regression
- Enhanced Signal Recovery via Sparsity Inducing Image Priors