English

Conditioning Sparse Variational Gaussian Processes for Online Decision-making

Machine Learning 2021-10-29 v1 Machine Learning

Abstract

With a principled representation of uncertainty and closed form posterior updates, Gaussian processes (GPs) are a natural choice for online decision making. However, Gaussian processes typically require at least O(n2)\mathcal{O}(n^2) computations for nn training points, limiting their general applicability. Stochastic variational Gaussian processes (SVGPs) can provide scalable inference for a dataset of fixed size, but are difficult to efficiently condition on new data. We propose online variational conditioning (OVC), a procedure for efficiently conditioning SVGPs in an online setting that does not require re-training through the evidence lower bound with the addition of new data. OVC enables the pairing of SVGPs with advanced look-ahead acquisition functions for black-box optimization, even with non-Gaussian likelihoods. We show OVC provides compelling performance in a range of applications including active learning of malaria incidence, and reinforcement learning on MuJoCo simulated robotic control tasks.

Keywords

Cite

@article{arxiv.2110.15172,
  title  = {Conditioning Sparse Variational Gaussian Processes for Online Decision-making},
  author = {Wesley J. Maddox and Samuel Stanton and Andrew Gordon Wilson},
  journal= {arXiv preprint arXiv:2110.15172},
  year   = {2021}
}

Comments

NeurIPS 2021

R2 v1 2026-06-24T07:16:05.039Z