2000 character limit reached
Quickest Change Detection for Multiple Data Streams Using the James-Stein Estimator
Published 8 Apr 2024 in math.ST, cs.IT, math.IT, and stat.TH | (2404.05486v2)
Abstract: The problem of quickest change detection is studied in the context of detecting an arbitrary unknown mean-shift in multiple independent Gaussian data streams. The James-Stein estimator is used in constructing detection schemes that exhibit strong detection performance both asymptotically and non-asymptotically. Our results indicate that utilizing the James-Stein estimator in the recently developed window-limited CuSum test constitutes a uniform improvement over its typical maximum likelihood variant. That is, the proposed James-Stein version achieves a smaller detection delay simultaneously for all possible post-change parameter values and every false alarm rate constraint, as long as the number of parallel data streams is greater than three. Additionally, an alternative detection procedure that utilizes the James-Stein estimator is shown to have asymptotic detection delay properties that compare favorably to existing tests. The second-order asymptotic detection delay term is reduced in a predefined low-dimensional subspace of the parameter space, while second-order asymptotic minimaxity is preserved. The results are verified in simulations, where the proposed schemes are shown to achieve smaller detection delays compared to existing alternatives, especially when the number of data streams is large.
- 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.
- V. V. Veeravalli and T. Banerjee, “Quickest change detection,” in Academic Press Library in Signal Processing. Elsevier, 2014, vol. 3, pp. 209–255.
- G. Lorden, “Procedures for reacting to a change in distribution,” The Annals of Mathematical Statistics, vol. 42, no. 6, pp. 1897–1908, 1971.
- 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.
- R. S. Sparks, “CUSUM charts for signalling varying location shifts,” Journal of Quality Technology, vol. 32, no. 2, pp. 157–171, 2000.
- G. Lorden and M. Pollak, “Nonanticipating estimation applied to sequential analysis and changepoint detection,” The Annals of Statistics, vol. 33, no. 3, pp. 1422 – 1454, 2005.
- Y. Cao, L. Xie, Y. Xie, and H. Xu, “Sequential change-point detection via online convex optimization,” Entropy, vol. 20, no. 2, 2018.
- L. Xie, G. V. Moustakides, and Y. Xie, “Window-limited CUSUM for sequential change detection,” IEEE Transactions on Information Theory, vol. 69, no. 9, pp. 5990–6005, 2023.
- E. J. Candès, “Modern statistical estimation via oracle inequalities,” Acta Numerica, vol. 15, p. 257–325, 2006.
- W. James and C. Stein, “Estimation with Quadratic Loss,” in Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics. University of California Press, 1961, pp. 361–379.
- J. Manton, V. Krishnamurthy, and H. Poor, “James-Stein state filtering algorithms,” IEEE Transactions on Signal Processing, vol. 46, no. 9, pp. 2431–2447, 1998.
- J. A. Meda-Campaña, “On the estimation and control of nonlinear systems with parametric uncertainties and noisy outputs,” IEEE Access, vol. 6, pp. 31 968–31 973, 2018.
- J. Hausser and K. Strimmer, “Entropy inference and the James-Stein estimator, with application to nonlinear gene association networks.” Journal of Machine Learning Research, vol. 10, no. 7, 2009.
- Y. Wu, B. Tracey, P. Natarajan, and J. P. Noonan, “James–Stein type center pixel weights for non-local means image denoising,” IEEE Signal Processing Letters, vol. 20, no. 4, pp. 411–414, 2013.
- M. P. Nguyen and S. Y. Chun, “Bounded self-weights estimation method for non-local means image denoising using minimax estimators,” IEEE Transactions on Image Processing, vol. 26, no. 4, pp. 1637–1649, 2017.
- Y. Wang and Y. Mei, “Large-scale multi-stream quickest change detection via shrinkage post-change estimation,” IEEE Transactions on Information Theory, vol. 61, no. 12, pp. 6926–6938, 2015.
- A. G. Tartakovsky, B. L. Rozovskii, R. B. Blažek, and H. Kim, “Detection of intrusions in information systems by sequential change-point methods,” Statistical Methodology, vol. 3, no. 3, pp. 252–293, 2006.
- A. G. Tartakovsky and V. V. Veeravalli, “Change-point detection in multichannel and distributed systems with applications,” in Applied Sequential Methodologies: An Edited Volume, N. Mukhopadhyay, S. Datta, and S. Chattopadhyay, Eds. Marcel-Dekker, 2004.
- Y. Mei, “Efficient scalable schemes for monitoring a large number of data streams,” Biometrika, vol. 97, no. 2, pp. 419–433, 2010.
- G. Fellouris and G. Sokolov, “Second-order asymptotic optimality in multisensor sequential change detection,” IEEE Transactions on Information Theory, vol. 62, no. 6, pp. 3662–3675, 2016.
- Y. Xie and D. Siegmund, “Sequential multi-sensor change-point detection,” The Annals of Statistics, vol. 41, no. 2, pp. 670 – 692, 2013.
- K. Liu, R. Zhang, and Y. Mei, “Scalable sum-shrinkage schemes for distributed monitoring large-scale data streams,” Statistica Sinica, vol. 29, no. 1, pp. 1–22, 2019.
- G. V. Moustakides, “Optimal stopping times for detecting changes in distributions,” The Annals of Statistics, vol. 14, no. 4, pp. 1379–1387, 1986.
- Q. Xu, Y. Mei, and G. V. Moustakides, “Optimum multi-stream sequential change-point detection with sampling control,” IEEE Transactions on Information Theory, vol. 67, no. 11, pp. 7627–7636, 2021.
- D. Siegmund and E. S. Venkatraman, “Using the generalized likelihood ratio statistic for sequential detection of a change-point,” The Annals of Statistics, vol. 23, no. 1, pp. 255 – 271, 1995.
- D. Siegmund and B. Yakir, “Minimax optimality of the shiryayev–roberts change-point detection rule,” Journal of Statistical Planning and Inference, vol. 138, no. 9, pp. 2815–2825, 2008.
- H. Robbins and D. Siegmund, “A class of stopping rules for testing parametric hypotheses,” in Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (Univ. California, Berkeley, CA, 1970/1971), vol. 4, 1972, pp. 37–41.
- ——, “The expected sample size of some tests of power one,” The Annals of Statistics, vol. 2, no. 3, pp. 415 – 436, 1974.
- B. Efron and C. Morris, “Stein’s estimation rule and its competitors–an empirical Bayes approach,” Journal of the American Statistical Association, vol. 68, no. 341, pp. 117–130, 1973.
- K. P. Srinath and R. Venkataramanan, “Cluster-seeking James–Stein estimators,” IEEE Transactions on Information Theory, vol. 64, no. 2, pp. 853–874, 2018.
- E. I. George, “Combining minimax shrinkage estimators,” Journal of the American Statistical Association, vol. 81, no. 394, pp. 437–445, 1986.
- A. W. van der Vaart, “Superefficiency,” in Festschrift for Lucien Le Cam: Research Papers in Probability and Statistics, D. Pollard, E. Torgersen, and G. L. Yang, Eds. Springer New York, 1997, pp. 397–410.
- L. LeCam, “On some asymptotic properties of maximum likelihood estimates and related Bayes’ estimates,” University of California Publications in Statistics., vol. 1, pp. 277–329, 1953.
- A. C. Brandwein, S. Ralescu, and W. E. Strawderman, “Shrinkage estimators of the location parameter for certain spherically symmetric distributions,” Annals of the Institute of Statistical Mathematics, vol. 45, pp. 551–565, 1993.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.