An Efficient Likelihood Ratio Test for Online Changepoint Detection in the Presence of Autocorrelation

• URL: http://arxiv.org/abs/2607.16106v1
• Date: Fri, 17 Jul 2026 16:40:30 GMT
• Title: An Efficient Likelihood Ratio Test for Online Changepoint Detection in the Presence of Autocorrelation
• Abstract summary: 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.<n>In this article, we extend the generalised iteration (GLR) statistic to autoregressive processes of order $p$, and adapt the focus algorithm to develop a computationally efficient online change detector.<n>The resulting AR($p$)-focus algorithm achieves an average computational cost of $mathcalO(log n)$ perratio, making it suitable for high-frequency data streams.
• Score: 2.607403443115235
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 $\mathcal{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.

Related papers

• TimePred: efficient and interpretable offline change point detection for high volume data - with application to industrial process monitoring [0.0]
  We introduce TimePred, a self-supervised framework for CPD in large-volume time series.<n>TimePred predicts each sample's normalized time index to predict mean-shift detection.<n>Experiments show competitive CPD performance while reducing computational cost by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2025-12-01T11:35:48Z)
• Real-Time Decorrelation-Based Anomaly Detection for Multivariate Time Series [1.4472678336151885]
  Anomaly detection plays a vital role across a wide range of real-world domains.<n>Demand for real-time AD has surged with the rise of the (Industrial) Internet of Things.<n>We propose DAD, a novel real-time decorrelation-based anomaly detection method.
  arXiv  Detail & Related papers  (2025-07-10T08:56:40Z)
• An Efficient Outlier Detection Algorithm for Data Streaming [51.56874851156008]
  Traditional outlier detection methods, such as the Local Outlier Factor (LOF) algorithm, struggle with real-time data.<n>We propose a novel approach to enhance the efficiency of LOF algorithms for online anomaly detection, named the Efficient Incremental LOF (EILOF) algorithm.<n>The EILOF algorithm not only significantly reduces computational costs, but also systematically improves detection accuracy when the number of additional points increases.
  arXiv  Detail & Related papers  (2025-01-02T05:12:43Z)
• Score-matching-based Structure Learning for Temporal Data on Networks [17.166362605356074]
  Causal discovery is a crucial initial step in establishing causality from empirical data and background knowledge.<n>Current score-matching-based algorithms are primarily designed to analyze independent and identically distributed (i.i.d.) data.<n>We have developed a new parent-finding subroutine for leaf nodes in DAGs, significantly accelerating the most time-consuming part of the process: the pruning step.
  arXiv  Detail & Related papers  (2024-12-10T12:36:35Z)
• PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detection [65.24854366973794]
  Node-level graph anomaly detection (GAD) plays a critical role in identifying anomalous nodes from graph-structured data in domains such as medicine, social networks, and e-commerce. We introduce a simple method termed PREprocessing and Matching (PREM for short) to improve the efficiency of GAD. Our approach streamlines GAD, reducing time and memory consumption while maintaining powerful anomaly detection capabilities.
  arXiv  Detail & Related papers  (2023-10-18T02:59:57Z)
• Exogenous Data in Forecasting: FARM -- A New Measure for Relevance Evaluation [62.997667081978825]
  We introduce a new approach named FARM - Forward Relevance Aligned Metric. Our forward method relies on an angular measure that compares changes in subsequent data points to align time-warped series. As a first validation step, we present the application of our FARM approach to synthetic but representative signals.
  arXiv  Detail & Related papers  (2023-04-21T15:22:33Z)
• A Log-Linear Non-Parametric Online Changepoint Detection Algorithm based on Functional Pruning [5.202524136984542]
  We build a flexible nonparametric approach to detect a change in the distribution of a sequence. Thanks to functional pruning ideas, NP-FOCuS has a computational cost that is log-linear in the number of observations. In terms of detection power, NP-FOCuS is seen to outperform current nonparametric online changepoint techniques in a variety of settings.
  arXiv  Detail & Related papers  (2023-02-06T11:50:02Z)
• Convolutional generative adversarial imputation networks for spatio-temporal missing data in storm surge simulations [86.5302150777089]
  Generative Adversarial Imputation Nets (GANs) and GAN-based techniques have attracted attention as unsupervised machine learning methods. We name our proposed method as Con Conval Generative Adversarial Imputation Nets (Conv-GAIN)
  arXiv  Detail & Related papers  (2021-11-03T03:50:48Z)
• Adaptive Anomaly Detection for Internet of Things in Hierarchical Edge Computing: A Contextual-Bandit Approach [81.5261621619557]
  We propose an adaptive anomaly detection scheme with hierarchical edge computing (HEC) We first construct multiple anomaly detection DNN models with increasing complexity, and associate each of them to a corresponding HEC layer. Then, we design an adaptive model selection scheme that is formulated as a contextual-bandit problem and solved by using a reinforcement learning policy network.
  arXiv  Detail & Related papers  (2021-08-09T08:45:47Z)
• DEALIO: Data-Efficient Adversarial Learning for Imitation from Observation [57.358212277226315]
  In imitation learning from observation IfO, a learning agent seeks to imitate a demonstrating agent using only observations of the demonstrated behavior without access to the control signals generated by the demonstrator. Recent methods based on adversarial imitation learning have led to state-of-the-art performance on IfO problems, but they typically suffer from high sample complexity due to a reliance on data-inefficient, model-free reinforcement learning algorithms. This issue makes them impractical to deploy in real-world settings, where gathering samples can incur high costs in terms of time, energy, and risk. We propose a more data-efficient IfO algorithm
  arXiv  Detail & Related papers  (2021-03-31T23:46:32Z)
• Change Point Detection in Time Series Data using Autoencoders with a Time-Invariant Representation [69.34035527763916]
  Change point detection (CPD) aims to locate abrupt property changes in time series data. Recent CPD methods demonstrated the potential of using deep learning techniques, but often lack the ability to identify more subtle changes in the autocorrelation statistics of the signal. We employ an autoencoder-based methodology with a novel loss function, through which the used autoencoders learn a partially time-invariant representation that is tailored for CPD.
  arXiv  Detail & Related papers  (2020-08-21T15:03:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.