Dynamic Online Ensembles of Basis Expansions

Daniel Waxman, Petar M. Djurić
5/2/2024
cs.LGeess.SPstat.ML

No official code found. Best implementation: DanWaxman/DynamicOnlineBasisExpansions (1 star, MIT, last commit 2024-09-13).

Abstract

Practical Bayesian learning often requires (1) online inference, (2) dynamic models, and (3) ensembling over multiple different models. Recent advances have shown how to use random feature approximations to achieve scalable, online ensembling of Gaussian processes with desirable theoretical properties and fruitful applications. One key to these methods' success is the inclusion of a random walk on the model parameters, which makes models dynamic. We show that these methods can be generalized easily to any basis expansion model and that using alternative basis expansions, such as Hilbert space Gaussian processes, often results in better performance. To simplify the process of choosing a specific basis expansion, our method's generality also allows the ensembling of several entirely different models, for example, a Gaussian process and polynomial regression. Finally, we propose a novel method to ensemble static and dynamic models together.

View on arXivView PDF

Code Implementations(1)

MIT

[TMLR 2024] Dynamic Online Ensembles of Basis Expansions

11PythonNov 20, 20232 years agoMIT
bayesian-inferencegaussian-processesmachine-learningonline-learning

Cite this paper

@article{waxman2024dynamic,
  title  = {Dynamic Online Ensembles of Basis Expansions},
  author = {Daniel Waxman and Petar M. Djurić},
  year   = {2024},
  eprint = {2405.01365},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.01365v1}
}

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/2405.01365.svg)](https://codeofpaper.com/paper/2405.01365)

Discussion