L1 Regularization
L1 Regularization is a type of penalization technique in machine learning that belongs to the class of regularization methods by imposing a penalty on the absolute values of the model coefficients, thereby promoting sparsity in the parameter estimates.
632
Publications
54.5K
Citations
1.8K
Authors
633
Institutions
Publications per year
2017–2026
234
Variants
Lasso Regularization
Parents
632
The Split Bregman Method for L1-Regularized Problems
Tom Goldstein, Stanley Osher · SIAM Journal on Imaging Sciences · 2009 · 4.3K citations
Fast and Robust Multiframe Super Resolution
Sina Farsiu, Michael D. Robinson, Michael Elad et al. · IEEE Transactions on Image Processing · 2004 · 2K citations
1–5 of 632
1.8K
Massachusetts Institute of Technology, United States
7 publications · 278 citations
7
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 1.8K
633

Chinese Academy of Sciences
Beijing, China
15 h-index
60 publications
2.2K citations
University of California, Berkeley
Berkeley, United States
14 h-index
35 publications
4.6K citations
Tsinghua University
Beijing, China
12 h-index
44 publications
2K citations
Stanford University
Stanford, United States
11 h-index
25 publications
5.4K citations
Google (United States)
Mountain View, United States
10 h-index
16 publications
2.4K citations
The University of Texas at Austin
Austin, United States
10 h-index
18 publications
3.8K citations
University of Pennsylvania
Philadelphia, United States
10 h-index
16 publications
681 citations

Zhejiang University
Hangzhou, China
10 h-index
12 publications
446 citations
1–8 of 633
Repository · 58 publications · 2.3K citations
24
h-index
11 publications · 282 citations
11
h-index
JMLR · 9 publications · 675 citations
9
h-index
Conference · 8 publications · 321 citations
8
h-index
8 publications · 283 citations
8
h-index
1–5