Comparative performance analysis of the Cumulative Sum chart and the Shiryaev‐Roberts procedure for detecting changes in autocorrelated data

Abstract

We consider the problem of quickest changepoint detection where the observations form a first-order autoregressive (AR(1)) process driven by temporally independent standard white Gaussian noise. Subject to possible change are both the drift of the AR(1) process ( ) and its correlation coefficient ( ), which are both known. The change is abrupt and persistent, and of known magnitude, with | | < 1 throughout. For this scenario, we carry out a comparative performance analysis of the popular cumulative sum (CUSUM) chart and its less well-known but worthy competitor, ie, the Shiryaev-Roberts (SR) procedure. Specifically, the performance is measured through Pollak's supremum (conditional) average delay to detection (SADD) constrained to a pre-specified level of the average run length (ARL) to false alarm. Particular attention is drawn to the sensitivity of each procedure's SADD and ARL with respect to the value of before and after the change. The performance is studied through the solution of the respective integral renewal equations obtained via Monte Carlo simulations. The simulations are designed to estimate the sought performance metrics in an unbiased and consistent manner, and within a prescribed proportional closeness (also asymptotically). Our extensive numerical studies suggest that both the CUSUM chart and the SR procedure are asymptotically second-order optimal, even though the CUSUM chart is found to be slightly better than the SR procedure, irrespective of the model parameters. Moreover, the existence of a worst-case post-change correlation parameter corresponding to the poorest detectability of the change for a given ARL to false alarm is established as well.To the best of our knowledge, this is the first time that the performance of the SR procedure is studied for autocorrelated data. KEYWORDSautoregressive processes, CUSUM chart, sequential analysis, sequential changepoint detection, Shiryaev-Roberts procedure 922

Anomaly Detection in Power System State Estimation: Review and New Directions

“…Further, the modified CUSUM and SR procedure algorithms [85] are employed in the same work as evaluation benchmarks for a so-called DeepQCD algorithm for online cyber-attack detection, which uses deep recurrent neural networks to detect changes in transient cases and with autocorrelated observations.…”

The Shiryaev–Roberts control chart for Markovian count time series

“…Comparisons between the two methods have a long tradition in the SPC literature; see, among others, Moustakides et al., 17 Pollak and Siegmund, 18 and Roberts 4 . More recently, Polunchenko and Raghavan 19 compared CUSUM and SR for the standard Gaussian AR(1) model. To the best of the author's knowledge, the SR control scheme has not yet been studied in a count time series framework.…”

ARL Estimation of the Control Chart of Log Likelihood Ratios’ Sum for Markov Sequence

“…Recently, the theoretical approximation to ARL was proposed in [26]. Detecting changes in distribution of the optimal control charts is the last category, which can be regarded as a kind of optimal stopping time [27][28][29].…”