Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quickest Change Detection with Confusing Change (2405.00842v1)

Published 1 May 2024 in math.ST, cs.IT, cs.LG, eess.SP, math.IT, math.OC, and stat.TH

Abstract: In the problem of quickest change detection (QCD), a change occurs at some unknown time in the distribution of a sequence of independent observations. This work studies a QCD problem where the change is either a bad change, which we aim to detect, or a confusing change, which is not of our interest. Our objective is to detect a bad change as quickly as possible while avoiding raising a false alarm for pre-change or a confusing change. We identify a specific set of pre-change, bad change, and confusing change distributions that pose challenges beyond the capabilities of standard Cumulative Sum (CuSum) procedures. Proposing novel CuSum-based detection procedures, S-CuSum and J-CuSum, leveraging two CuSum statistics, we offer solutions applicable across all kinds of pre-change, bad change, and confusing change distributions. For both S-CuSum and J-CuSum, we provide analytical performance guarantees and validate them by numerical results. Furthermore, both procedures are computationally efficient as they only require simple recursive updates.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. V. V. Veeravalli and T. Banerjee, “Quickest change detection,” in Academic press library in signal processing.   Elsevier, 2014, vol. 3, pp. 209–255.
  2. L. Xie, S. Zou, Y. Xie, and V. V. Veeravalli, “Sequential (quickest) change detection: Classical results and new directions,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 2, pp. 494–514, 2021.
  3. T. Banerjee and V. V. Veeravalli, “Data-efficient quickest change detection in sensor networks,” IEEE Transactions on Signal Processing, vol. 63, no. 14, pp. 3727–3735, 2015.
  4. Z. Sun, S. Zou, R. Zhang, and Q. Li, “Quickest change detection in anonymous heterogeneous sensor networks,” IEEE Transactions on Signal Processing, vol. 70, pp. 1041–1055, 2022.
  5. L. Lai, Y. Fan, and H. V. Poor, “Quickest detection in cognitive radio: A sequential change detection framework,” in IEEE GLOBECOM 2008-2008 IEEE Global Telecommunications Conference.   IEEE, 2008, pp. 1–5.
  6. T. L. Lai, “Sequential changepoint detection in quality control and dynamical systems,” Journal of the Royal Statistical Society: Series B (Methodological), vol. 57, no. 4, pp. 613–644, 1995.
  7. W. H. Woodall, D. J. Spitzner, D. C. Montgomery, and S. Gupta, “Using control charts to monitor process and product quality profiles,” Journal of Quality Technology, vol. 36, no. 3, pp. 309–320, 2004.
  8. T. Banerjee, Y. C. Chen, A. D. Dominguez-Garcia, and V. V. Veeravalli, “Power system line outage detection and identification—a quickest change detection approach,” in 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).   IEEE, 2014, pp. 3450–3454.
  9. J. Sun, M. Saeedifard, and A. S. Meliopoulos, “Backup protection of multi-terminal hvdc grids based on quickest change detection,” IEEE Transactions on Power Delivery, vol. 34, no. 1, pp. 177–187, 2018.
  10. F. Ji, W. P. Tay, and L. R. Varshney, “An algorithmic framework for estimating rumor sources with different start times,” IEEE Transactions on Signal Processing, vol. 65, no. 10, pp. 2517–2530, 2017.
  11. Y. Liang and V. V. Veeravalli, “Quickest change detection with leave-one-out density estimation,” in ICASSP 2023-2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).   IEEE, 2023, pp. 1–5.
  12. A. G. Tartakovsky, B. L. Rozovskii, R. B. Blazek, and H. Kim, “A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods,” IEEE transactions on signal processing, vol. 54, no. 9, pp. 3372–3382, 2006.
  13. ——, “Sequential change-point detection when unknown parameters are present in the pre-change distribution,” 2006.
  14. G. Rovatsos, X. Jiang, A. D. Domínguez-García, and V. V. Veeravalli, “Statistical power system line outage detection under transient dynamics,” IEEE Transactions on Signal Processing, vol. 65, no. 11, pp. 2787–2797, 2017.
  15. A. Warner and G. Fellouris, “Sequential change diagnosis revisited and the adaptive matrix cusum,” arXiv preprint arXiv:2211.12980, 2022.
  16. X. Zhao, J. Hu, Y. Mei, and H. Yan1, “Adaptive partially observed sequential change detection and isolation,” Technometrics, vol. 64, no. 4, pp. 502–512, 2022.
  17. S. Zou, G. Fellouris, and V. V. Veeravalli, “Quickest change detection under transient dynamics: Theory and asymptotic analysis,” IEEE Transactions on Information Theory, vol. 65, no. 3, pp. 1397–1412, 2018.
  18. T. S. Lau and W. P. Tay, “Quickest change detection in the presence of a nuisance change,” IEEE Transactions on Signal Processing, vol. 67, no. 20, pp. 5281–5296, 2019.
  19. V. Dragalin, “The design and analysis of 2-cusum procedure,” Communications in Statistics-Simulation and Computation, vol. 26, no. 1, pp. 67–81, 1997.
  20. Y. Zhao, F. Tsung, and Z. Wang, “Dual cusum control schemes for detecting a range of mean shifts,” IIE transactions, vol. 37, no. 11, pp. 1047–1057, 2005.
  21. M. Pollak, “Optimal detection of a change in distribution,” The Annals of Statistics, pp. 206–227, 1985.
  22. T. L. Lai, “Information bounds and quick detection of parameter changes in stochastic systems,” IEEE Transactions on Information theory, vol. 44, no. 7, pp. 2917–2929, 1998.
  23. G. Fellouris and A. G. Tartakovsky, “Multichannel sequential detection—part i: Non-iid data,” IEEE Transactions on Information Theory, vol. 63, no. 7, pp. 4551–4571, 2017.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now