Sparsity Constraints
Sparsity Constraints is a methodological framework in machine learning that imposes restrictions on the number or distribution of non-zero parameters within a model to enforce structural simplicity and improve computational efficiency.
2.9K
Publications
222.3K
Citations
8.6K
Authors
1.9K
Institutions
Publications per year
2017–2026
1.4K
Parents
2.9K
XGBoost: A Scalable Tree Boosting System
arXiv (Cornell University) · 2016 · 7.1K citations · Full text
1–5 of 2.9K
8.6K
13
h-index
13
h-index
12
h-index
University of California, Berkeley, United States
13 publications · 2.7K citations
12
h-index
11
h-index
1–5 of 8.6K
1.9K

Chinese Academy of Sciences
Beijing, China
42 h-index
258 publications
24.3K citations
Tsinghua University
Beijing, China
40 h-index
289 publications
17.1K citations
Stanford University
Stanford, United States
33 h-index
122 publications
26.4K citations
Carnegie Mellon University
Pittsburgh, United States
31 h-index
100 publications
9K citations
University of California, Berkeley
Berkeley, United States
30 h-index
88 publications
18.3K citations

University of Electronic Science and Technology of China
Chengdu, China
29 h-index
145 publications
6.5K citations

Shanghai Jiao Tong University
Shanghai, China
28 h-index
118 publications
9.7K citations
Nanyang Technological University
Singapore, Singapore
25 h-index
75 publications
7.2K citations
1–8 of 1.9K
Repository · 182 publications · 8.6K citations
48
h-index
73 publications · 17.4K citations
39
h-index
43 publications · 9.8K citations
33
h-index
47 publications · 3.2K citations
29
h-index
40 publications · 4K citations
27
h-index
1–5