Bayesian Online Changepoint Detection
Ryan Prescott Adams, David J.C. MacKay

TL;DR
This paper introduces an online Bayesian algorithm for real-time detection of changepoints in data sequences, enabling prompt identification of abrupt shifts in various applications.
Contribution
It derives an exact Bayesian online inference algorithm for changepoint detection with independent pre- and post-change parameters, adaptable to different data types.
Findings
Effective in real-world datasets
Modular and adaptable algorithm
Provides exact inference for recent changepoints
Abstract
Changepoints are abrupt variations in the generative parameters of a data sequence. Online detection of changepoints is useful in modelling and prediction of time series in application areas such as finance, biometrics, and robotics. While frequentist methods have yielded online filtering and prediction techniques, most Bayesian papers have focused on the retrospective segmentation problem. Here we examine the case where the model parameters before and after the changepoint are independent and we derive an online algorithm for exact inference of the most recent changepoint. We compute the probability distribution of the length of the current ``run,'' or time since the last changepoint, using a simple message-passing algorithm. Our implementation is highly modular so that the algorithm may be applied to a variety of types of data. We illustrate this modularity by demonstrating the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference · Advanced Statistical Process Monitoring
