Consistent Parameter Estimation for LASSO and Approximate Message Passing
Not on the map. Why?
Abstract (arXiv)
We consider the problem of recovering a vector βo ∈ ℝp from n random and noisy linear observations y= Xβo + w, where X is the measurement matrix and w is noise. The LASSO estimate is given by the solution to the optimization problem hatβλ = arg minβ frac12 |y-Xβ|22 + λ | β |1. Among the iterative algorithms that have been proposed for solving this optimization problem, approximate message passing (AMP) has attracted attention for its fast convergence. Despite significant progress in the theoretical analysis of the estimates of LASSO and AMP, little is known about their behavior as a function of the regularization parameter λ, or the thereshold parameters τt. For instance the following basic questions have not yet been studied in the literature: (i) How does the size of the active set |hatβλ|0/p behave as a function of λ? (ii) How does the mean square error |hatβλ - βo|22/p behave as a function of λ? (iii) How does |βt - βo |22/p behave as a function of τ1, ldots, τt-1? Answering these questions will help in addressing practical challenges regarding the optimal tuning of λ or τ1, τ2, ldots. This paper answers these questions in the asymptotic setting and shows how these results can be employed in deriving simple and theoretically optimal approaches for tuning the parameters τ1, ldots, τt for AMP or λ for LASSO. It also explores the connection between the optimal tuning of the parameters of AMP and the optimal tuning of LASSO.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 1; 2025: 2.
6 papers.
- 2025Certified Data Removal Under High-dimensional Settingscited by 6
- 2024Theoretical Analysis of Leave-one-out Cross Validation for Non-differentiable Penalties under High-dimensional Settingscited by 5
- 2021Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limitcited by 4
- 2021Efficient Designs of SLOPE Penalty Sequences in Finite Dimensioncited by 3
- 2023Automatic Hyperparameter Tuning in Sparse Matrix Factorizationcited by 1
- 2025A Ridge Too Far: Correcting Over-Shrinkage via Negative Regularizationcited by 0
- 2025A Ridge Too Far: Correcting Over-Shrinkage via Negative Regularization24 Aug 2025
- 2025Certified Data Removal Under High-dimensional Settings12 May 2025
- 2024Theoretical Analysis of Leave-one-out Cross Validation for Non-differentiable Penalties under High-dimensional Settings13 Feb 2024
- 2023Automatic Hyperparameter Tuning in Sparse Matrix Factorization17 May 2023
- 2021Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit27 May 2021
- 2021Efficient Designs of SLOPE Penalty Sequences in Finite Dimension14 Feb 2021