Fast Online Changepoint Detection via Functional Pruning CUSUM Statistics
Gaetano Romano, Idris A. Eckley, Paul Fearnhead, Guillem Rigaill; 24(81):1−36, 2023.
Abstract
Many modern applications of online changepoint detection require the ability to process high-frequency observations, sometimes with limited available computational resources. Online algorithms for detecting a change in mean often involve using a moving window, or specifying the expected size of change. Such choices affect which changes the algorithms have most power to detect. We introduce an algorithm, Functional Online CuSUM (FOCuS), which is equivalent to running these earlier methods simultaneously for all sizes of windows, or all possible values for the size of change. Our theoretical results give tight bounds on the expected computational cost per iteration of FOCuS, with this being logarithmic in the number of observations. We show how FOCuS can be applied to a number of different changes in mean scenarios, and demonstrate its practical utility through its state-of-the-art performance at detecting anomalous behaviour in computer server data.
[abs]
[pdf][bib] [code]| © JMLR 2023. (edit, beta) |