Sparse Gaussian Processes
Sparse Gaussian Processes is a class of approximation methods for Gaussian processes that reduce computational complexity by utilizing a subset of inducing points to sparsify the covariance structure while preserving the core probabilistic modeling capabilities.
257
Publications
18.8K
Citations
661
Authors
256
Institutions
Publications per year
2017–2026
132
Variants
Sparse Gaussian Process
257
Sparse Gaussian Processes using Pseudo-inputs
Edward Snelson, Zoubin Ghahramani · 2005 · 1.3K citations
Sparse On-Line Gaussian Processes
Lehel Csató, Manfred Opper · Neural Computation · 2002 · 763 citations · Full text
1–5 of 257
661
8
h-index
8
h-index
8
h-index
7
h-index
6
h-index
1–5 of 661
256
University of Cambridge
Cambridge, United Kingdom
15 h-index
28 publications
2.3K citations
National University of Singapore
Singapore, Singapore
12 h-index
35 publications
948 citations

Imperial College London
London, United Kingdom
10 h-index
24 publications
824 citations
University of Sheffield
Sheffield, United Kingdom
10 h-index
19 publications
1.4K citations
Georgia Institute of Technology
Atlanta, United States
9 h-index
25 publications
1.9K citations
University of Oxford
Oxford, United Kingdom
9 h-index
23 publications
1.3K citations
Max Planck Society
Munich, Germany
6 h-index
10 publications
4.6K citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
9 publications
323 citations
1–8 of 256
Repository · 35 publications · 1.3K citations
21
h-index
Conference · 6 publications · 625 citations
6
h-index
Conference · 5 publications · 113 citations
5
h-index
4 publications · 120 citations
4
h-index
Repository · 4 publications · 601 citations
4
h-index
1–5