Robust and Scalable Bayesian Online Changepoint Detection

Matias Altamirano, François-Xavier Briol, Jeremias Knoblauch
2/9/2023
stat.MLcs.LG

No official code found. Best implementation: maltamiranomontero/DSM-bocd (24 stars, MIT, last commit 2023-08-04).

Abstract

This paper proposes an online, provably robust, and scalable Bayesian approach for changepoint detection. The resulting algorithm has key advantages over previous work: it provides provable robustness by leveraging the generalised Bayesian perspective, and also addresses the scalability issues of previous attempts. Specifically, the proposed generalised Bayesian formalism leads to conjugate posteriors whose parameters are available in closed form by leveraging diffusion score matching. The resulting algorithm is exact, can be updated through simple algebra, and is more than 10 times faster than its closest competitor.

View on arXivView PDF

Code Implementations(1)

MIT
246Python, Jupyter NotebookSep 2, 20223 years agoMIT

Similar Papers

Cite this paper

@article{altamirano2023robust,
  title  = {Robust and Scalable Bayesian Online Changepoint Detection},
  author = {Matias Altamirano and François-Xavier Briol and Jeremias Knoblauch},
  year   = {2023},
  eprint = {2302.04759},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.04759v2},
  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/2302.04759.svg)](https://codeofpaper.com/paper/2302.04759)

Discussion