Properties and iterative methods for the lasso and its variants (Q741471)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Properties and iterative methods for the lasso and its variants |
scientific article; zbMATH DE number 6343665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Properties and iterative methods for the lasso and its variants |
scientific article; zbMATH DE number 6343665 |
Statements
Properties and iterative methods for the lasso and its variants (English)
0 references
12 September 2014
0 references
The author introduces several new iterative algorithms based on the proximal map and proves the convergence of the generated sequences. The results are applied to approximate a solution of the minizimization problem \[ \min_{x}{1 \over 2} \|Ax-b\|_{2}^{2} {\;subject\;to\;}\|x\|_{1}\leq t, \] known as least absolute shrinkage operator (or lasso) and first introduced in [\textit{R. Tibshirani}, J. R. Stat. Soc., Ser. B 58, No. 1, 267--288 (1996; Zbl 0850.62538)]. Convergence theorems for solving two variants of lasso are also proved.
0 references
lasso
0 references
elastic net
0 references
smooth-lasso
0 references
\(\ell_ 1\) regularization
0 references
sparsity
0 references
proximal method
0 references
dual method
0 references
projection
0 references
thresholding
0 references
0 references
0.866604208946228
0 references
0.8532836437225342
0 references
0.845274031162262
0 references
0.7954471707344055
0 references