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

Authors

661

  1. ND
    Neil D. Lawrence

    University of Sheffield, United Kingdom

    8 publications · 1.3K citations

    8

    h-index

  2. CE
    Carl Edward Rasmussen

    University of Cambridge, United Kingdom

    8 publications · 2.6K citations

    8

    h-index

  3. BB
    Byron Boots

    Georgia Institute of Technology, United States

    8 publications · 397 citations

    8

    h-index

  4. ZG
    Zoubin Ghahramani

    University of Cambridge, United Kingdom

    7 publications · 1.7K citations

    7

    h-index

  5. BK
    Bryan Kian Hsiang Low

    National University of Singapore, Singapore

    6 publications · 192 citations

    6

    h-index

1–5 of 661

Venues

  1. arXiv (Cornell University)

    Repository · 35 publications · 1.3K citations

    21

    h-index

  2. Neural Information Processing Systems

    Conference · 6 publications · 625 citations

    6

    h-index

  3. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 5 publications · 113 citations

    5

    h-index

  4. IEEE Transactions on Signal Processing

    4 publications · 120 citations

    4

    h-index

  5. Infoscience (Ecole Polytechnique Fédérale de Lausanne)

    Repository · 4 publications · 601 citations

    4

    h-index

1–5