Sparse Reduction
Sparse Reduction is a reduction operation that belongs to the class of computational methods optimized for sparsity, distinguished by its focus on efficiently aggregating non-zero elements in sparse data structures while minimizing redundant computations on zero-valued entries.
78
Publications
4.5K
Citations
220
Authors
116
Institutions
Publications per year
2017–2026
14
Parents
78
Sparse PCA: Optimal rates and adaptive estimation
Tommaso Cai, Zongming Ma, Yihong Wu · The Annals of Statistics · 2013 · 305 citations · Full text
Sparse dynamics for partial differential equations
Hayden Schaeffer, Russel E. Caflisch, Cory D. Hauck et al. · Proceedings of the National Academy of Sciences · 2013 · 177 citations · Full text
1–5 of 78
220
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 220
116
Stanford University
Stanford, United States
3 h-index
6 publications
149 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
7 publications
149 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
6 publications
339 citations
University of California, Berkeley
Berkeley, United States
2 h-index
4 publications
432 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
49 citations
Princeton University
Princeton, United States
2 h-index
4 publications
180 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
149 citations

University of Exeter
Exeter, United Kingdom
2 h-index
3 publications
64 citations
1–8 of 116
4 publications · 171 citations
4
h-index
Repository · 3 publications · 475 citations
3
h-index
2 publications · 100 citations
2
h-index
2 publications · 31 citations
2
h-index
2 publications · 43 citations
2
h-index
1–5