2026/07/17 by Yuntang Fan, Paul Fearnhead, Idris A. Eckley +1 · 1 citation
#stat.ME #stat.CO #stat.ML
Changepoint detection methods have seen considerable development in recent years, with online algorithms capable of identifying structural changes in streaming data in near real time. However, the majority of existing methods are designed under the assumption of IID observations, rendering them susceptible to either more false positives or longer detection delays when applied to data exhibiting temporal dependence, a common feature of many real-world data streams. In this article, we extend the generalised likelihood-ratio (GLR) statistic to autoregressive processes of order p, and adapt the focus algorithm to develop a computationally efficient online change detector. The resulting AR(p)-focus algorithm achieves an average computational cost of O(log n) per iteration, making it suitable for high-frequency data streams. Through simulation studies, the proposed approach is seen achieving greater detection power than IID-based tests when the underlying data exhibit temporal correlation. We further illustrate the practical utility of AR(p)-focus through an application to a real-world telecommunications dataset.