On Lasso refitting strategies
From MaRDI portal
Publication:2325356
DOI10.3150/18-BEJ1085zbMath1435.62268arXiv1707.05232OpenAlexW2972619051MaRDI QIDQ2325356
Evgenii Chzhen, Joseph Salmon, Mohamed Hebiri
Publication date: 25 September 2019
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05232
Related Items
Block-based refitting in \(\ell_{12}\) sparse regularization ⋮ Simple expressions of the LASSO and SLOPE estimators in low-dimension ⋮ On Lasso refitting strategies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- On the prediction performance of the Lasso
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Sparse recovery via differential inclusions
- Relaxed Lasso
- Bias reduction in variational regularization
- The Lasso problem and uniqueness
- Least squares after model selection in high-dimensional sparse models
- High-dimensional variable screening and bias in subsequent inference, with an empirical comparison
- On Lasso refitting strategies
- Simultaneous analysis of Lasso and Dantzig selector
- On Debiasing Restoration Algorithms: Applications to Total-Variation and Nonlocal-Means
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Boosting With theL2Loss
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- CLEAR: Covariant LEAst-Square Refitting with Applications to Image Restoration
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- An Iterative Regularization Method for Total Variation-Based Image Restoration
