Memory-Based Dual Gaussian Processes for Sequential Learning

Paul E. Chang, Prakhar Verma, S. T. John, Arno Solin, Mohammad Emtiyaz Khan
6/6/2023
cs.LGstat.ML

No official code found. Best implementation: AaltoML/sequential-gp (12 stars, MIT, last commit 2023-08-16).

Abstract

Sequential learning with Gaussian processes (GPs) is challenging when access to past data is limited, for example, in continual and active learning. In such cases, errors can accumulate over time due to inaccuracies in the posterior, hyperparameters, and inducing points, making accurate learning challenging. Here, we present a method to keep all such errors in check using the recently proposed dual sparse variational GP. Our method enables accurate inference for generic likelihoods and improves learning by actively building and updating a memory of past data. We demonstrate its effectiveness in several applications involving Bayesian optimization, active learning, and continual learning.

View on arXivView PDF

Code Implementations(1)

MIT

Code for 'Memory-based dual Gaussian processes for sequential learning' (ICML 2023)

123TeX, ShellMay 25, 20233 years agoMIT
continual-learninggaussian-processicml-2023

Similar Papers

Cite this paper

@article{chang2023memorybased,
  title  = {Memory-Based Dual Gaussian Processes for Sequential Learning},
  author = {Paul E. Chang and Prakhar Verma and S. T. John and Arno Solin and Mohammad Emtiyaz Khan},
  year   = {2023},
  eprint = {2306.03566},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.03566v1},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.03566.svg)](https://codeofpaper.com/paper/2306.03566)

Discussion