Metraipolis › archive › dc_dacbd39956da

Bagel: A Fast Bayesian Online Changepoint Detection Algorithm for Linear Models via Posterior Merging — arXiv:2611.03230

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03230
License (as archived)
CC0-1.0
Archived
2026-11-03T18:42:37.971Z
SHA-256 of the archived text
6f309e64745b717b3eec7cf71957cb366d5a4e9a07c28010e37ab5e042ecd842
Stable URL of this page
https://metraipolis.com/documento/dc_dacbd39956da

How to cite

Bagel: A Fast Bayesian Online Changepoint Detection Algorithm for Linear Models via Posterior Merging — arXiv:2611.03230 — arXiv (en), https://arxiv.org/abs/2611.03230 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dacbd39956da (Metraipolis archive dc_dacbd39956da, sha256 6f309e64745b717b3eec7cf71957cb366d5a4e9a07c28010e37ab5e042ecd842)
BibTeX
@misc{dcdacbd39956da,
  title = {Bagel: A Fast Bayesian Online Changepoint Detection Algorithm for Linear Models via Posterior Merging — arXiv:2611.03230},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03230},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dacbd39956da; sha256 6f309e64745b717b3eec7cf71957cb366d5a4e9a07c28010e37ab5e042ecd842},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03230. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Bayesian online changepoint detection provides a natural framework for quantifying uncertainty about whether and when a change has occurred. It also enables the use of prior information which can increase detection power. Exact Bayesian inference sequentially updates the posterior of whether and when a change has occurred. We present a unified approach to calculating and updating this posterior for a class of regression models covering standard changepoint scenarios, such as changes in mean and slope, whilst also allowing common structure such as seasonal effects. However, naive implementation has a computational cost that increases linearly over time. We, further, introduce approximate updates that keep this cost constant. These are based on novel ideas of merging changepoint times, and are an alternative to existing pruning approaches. We show that merging enables better approximations of the posterior of when a change occurs. Furthermore, we introduce a novel condition for merging that accounts for both the posterior probability of the changepoint times and the similarity of their corresponding post-change parameters. We show that this is more accurate than conditions that only consider the former. We demonstrate the advantage of our approach on simulated data, and the Azure LLM inference traces.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno).
Categorie arXiv: Methodology (stat.ME) ; Computation (stat.CO); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2611.03230 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:13:37.702Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).