Adaptive multi-penalty regularization based on a generalized Lasso path
DOI10.1016/j.acha.2018.11.001zbMath1434.68408arXiv1710.03971OpenAlexW2964065098WikidataQ125685045 ScholiaQ125685045MaRDI QIDQ2175012
Timo Klock, Markus Grasmair, Valeriya Naumova
Publication date: 27 April 2020
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.03971
compressed sensingadaptive parameter choicemulti-penalty regularizationLasso pathexact support recoverynoise folding
Ridge regression; shrinkage estimators (Lasso) (62J07) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- Hard thresholding pursuit algorithms: number of iterations
- Sparse recovery via differential inclusions
- Least angle regression. (With discussion)
- The Lasso problem and uniqueness
- Preconditioning the Lasso for sign consistency
- Piecewise linear regularized solution paths
- Sparsity-enforcing regularisation and ISTA revisited
- Conditions on optimal support recovery in unmixing problems by means of multi-penalty regularization
- Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices
- Uncertainty Principles and Signal Recovery
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Uncertainty principles and ideal atomic decomposition
- Damping Noise-Folding and Enhanced Support Recovery in Compressed Sensing
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Information Theoretic Bounds for Compressed Sensing
- Regularization and Variable Selection Via the Elastic Net
- Robust Estimation of a Location Parameter
This page was built for publication: Adaptive multi-penalty regularization based on a generalized Lasso path