Bayesian quickest change detection for unnormalized and score-based models

REFERENCES

• Andrieu, Christophe, and Johannes Thoms. 2008. “A Tutorial on Adaptive MCMC.” Statistics and Computing 18 (4): 343–373. https://doi.org/10.1007/s11222-008-9110-y.
   Web of Science ®Google Scholar
• Banerjee, Taposh, Hamed Firouzi, and Alfred O. Hero. 2018. “Quickest Detection for Changes in Maximal kNN Coherence of Random Matrices.” IEEE Transactions on Signal Processing 66 (17): 4490–4503. https://doi.org/10.1109/TSP.2018.2855644.
   Web of Science ®Google Scholar
• Basseville, Michele, and Igor V. Nikiforov. 1993. Detection of Abrupt Changes: Theory and Application. Vol. 104. Englewood Cliffs, NJ: Prentice Hall.
   Google Scholar
• Brodsky, Emily, and Boris S. Darkhovsky. 1993. Nonparametric Methods in Change Point Problems. Vol. 243. Norwell, MA: Springer Science & Business Media.
   Google Scholar
• Darkhovsky, Boris, and Alexandra Piryatinska. 2014a. “Quickest Detection of Changes in the Generating Mechanism of a Time Series via the ε-Complexity of Continuous Functions.” Sequential Analysis 33 (2): 231–250. https://doi.org/10.1080/07474946.2014.896698.
   Web of Science ®Google Scholar
• Darkhovsky, Boris, and Alexandra Piryatinska. 2014b. “New Approach to the Segmentation Problem for Time Series of Arbitrary Nature.” Proceedings of the Steklov Institute of Mathematics 287 (1): 54–67. https://doi.org/10.1134/S0081543814080045.
   Web of Science ®Google Scholar
• Darkhovsky, Boris, and Alexandra Piryatinska. 2015. “Novel Methodology of Change-Points Detection for Time Series with Arbitrary Generating Mechanisms.” In Stochastic Models, Statistics and Their Applications: Wrocław, Poland, February 2015, edited by Ansgar Steland, Ewaryst Rafajłowicz and Krzysztof Szajowski, 241–51. Switzerland: Springer.
   Google Scholar
• Darkhovsky, Boris, and Alexandra Piryatinska. 2018a. “Classification of Multivariate Time Series of Arbitrary Nature Based on the ε-Complexity Theory.” In Statistics and Simulation, 231–242.
   Google Scholar
• Darkhovsky, Boris, and Alexandra Piryatinska. 2018b. “Model-Free Offline Change-Point Detection in Multidimensional Time Series of Arbitrary Nature via ε-Complexity: Simulations and Applications.” Applied Stochastic Models in Business and Industry 34 (5): 633–644. https://doi.org/10.1002/asmb.2303.
   Web of Science ®Google Scholar
• Gordon, Louis, and Moshe Pollak. 1994. “An Efficient Sequential Nonparametric Scheme for Detecting a Change of Distribution.” The Annals of Statistics 22 (2): 763–804. https://doi.org/10.1214/aos/1176325495.
   Web of Science ®Google Scholar
• Hou, Yingze, Yousef Oleyaeimotlagh, Rahul Mishra, Hoda Bidkhori, and Taposh Banerjee. 2023. “Robust Quickest Change Detection in Non-Stationary Processes.” arXiv preprint arXiv: 2310.09673.
   Google Scholar
• Hyvärinen, Aapo. 2005. “Estimation of Non-Normalized Statistical Models by Score Matching.” Journal of Machine Learning Research 6 (4): 695–709.
   PubMedGoogle Scholar
• Kang, Jiwon, and Junmo Song. 2017. “Score Test for Parameter Change in Poisson Autoregressive Models.” Economics Letters 160: 33–37. https://doi.org/10.1016/j.econlet.2017.08.021.
   Web of Science ®Google Scholar
• Konev, Victor, and Sergey Vorobeychikov. 2017. “Quickest Detection of Parameter Changes in Stochastic Regression: Nonparametric CUSUM.” IEEE Transactions on Information Theory 63 (9): 1. https://doi.org/10.1109/TIT.2017.2673825.
   Web of Science ®Google Scholar
• Lai, Tze Leung. 1998. “Information Bounds and Quick Detection of Parameter Changes in Stochastic Systems.” IEEE Transactions on Information Theory 44 (7): 2917–2929.
   Web of Science ®Google Scholar
• Lau, Tze Siong, Wee Peng Tay, and Venugopal V. Veeravalli. 2019. “A Binning Approach to Quickest Change Detection with Unknown Post-Change Distribution.” IEEE Transactions on Signal Processing 67 (3): 609–621. https://doi.org/10.1109/TSP.2018.2881666.
   Web of Science ®Google Scholar
• Liang, Yuchen, and Venugopal V. Veeravalli. 2022. “Non-Parametric Quickest Mean-Change Detection.” IEEE Transactions on Information Theory 68 (12): 8040–8052. https://doi.org/10.1109/TIT.2022.3191957.
   Web of Science ®Google Scholar
• Liu, Qiang, and Dilin Wang. 2016. “Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithm.” Advances in Neural Information Processing Systems 29, Barcelona, Spain.
   Google Scholar
• Lorden, G. 1971. “Procedures for Reacting to a Change in Distribution.” The Annals of Mathematical Statistics 42 (6): 1897–1908. https://doi.org/10.1214/aoms/1177693055.
   Google Scholar
• Moustakides, G. V. 1986. “Optimal Stopping Times for Detecting Changes in Distributions.” The Annals of Statistics 14 (4): 1379–1387.
   Web of Science ®Google Scholar
• Oleyaeimotlagh, Yousef, Taposh Banerjee, Ahmad Taha, and Eugene John. 2023. “Quickest Change Detection in Statistically Periodic Processes with Unknown Post-Change Distribution.” Sequential Analysis 42 (4): 404–437. https://doi.org/10.1080/07474946.2023.2247035.
   Google Scholar
• Page, E. S. 1954. “Continuous Inspection Schemes.” Biometrika 41 (1-2): 100–115. https://doi.org/10.1093/biomet/41.1-2.100.
   Web of Science ®Google Scholar
• Pawlak, Mirosław, and Ansgar Steland. 2013. “Nonparametric Sequential Signal Change Detection under Dependent Noise.” IEEE Transactions on Information Theory 59 (6): 3514–3531. https://doi.org/10.1109/TIT.2013.2243200.
   Web of Science ®Google Scholar
• Pollak, Moshe. 1985. “Optimal Detection of a Change in Distribution.” The Annals of Statistics 13 (1): 206–227.
   Web of Science ®Google Scholar
• Polunchenko, Aleksey S., and Alexander G. Tartakovsky. 2012. “State-of-the-Art in Sequential Change-Point Detection.” Methodology and Computing in Applied Probability 14 (3): 649–684. https://doi.org/10.1007/s11009-011-9256-5.
   Web of Science ®Google Scholar
• Poor, H. Vincent, and Olympia Hadjiliadis. 2009. Quickest Detection. New York, USA: Cambridge University Press.
   Google Scholar
• Sarnowski, Wojciech, and Krzysztof Szajowski. 2011. “Optimal Detection of Transition Probability Change in Random Sequence.” Stochastics 83 (4-6): 569–581. https://doi.org/10.1080/17442508.2010.540015.
   Google Scholar
• Shiryaev, Albert N. 1963. “On Optimum Methods in Quickest Detection Problems.” Theory of Probability & Its Applications 8 (1): 22–46. https://doi.org/10.1137/1108002.
   Google Scholar
• Shiryaev, Albert N. 2007. Optimal Stopping Rules. Vol. 8. New York, USA: Springer Science & Business Media.
   Google Scholar
• Song, Junmo, and Jiwon Kang. 2020. “Sequential Change Point Detection in ARMA-GARCH Models.” Journal of Statistical Computation and Simulation 90 (8): 1520–1538. https://doi.org/10.1080/00949655.2020.1734807.
   Web of Science ®Google Scholar
• Song, Yang, and Stefano Ermon. 2019. “Generative Modeling by Estimating Gradients of the Data Distribution.” Advances in Neural Information Processing Systems 32, Vancouver, Canada.
   Google Scholar
• Song, Yang, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. 2021. “Score-Based Generative Modeling through Stochastic Differential Equations.” In International Conference on Learning Representations ICLR 2021, Vienna, Austria.
   Google Scholar
• Tartakovsky, Alexander. 2019. Sequential Change Detection and Hypothesis Testing: General Non-i.i.d. Stochastic Models and Asymptotically Optimal Rules. Boca Raton, FL: CRC Press.
   Google Scholar
• Tartakovsky, Alexander G. 2017. “On Asymptotic Optimality in Sequential Changepoint Detection: Non-Iid Case.” IEEE Transactions on Information Theory 63 (6): 3433–3450. https://doi.org/10.1109/TIT.2017.2683496.
   Web of Science ®Google Scholar
• Tartakovsky, Alexander G., Igor V. Nikiforov, and Michele. Basseville. 2014. Sequential Analysis: Hypothesis Testing and Change-Point Detection. Statistics. Boca Raton, FL: CRC Press.
   Google Scholar
• Tartakovsky, Alexander G., and V. V. Veeravalli. 2005. “General Asymptotic Bayesian Theory of Quickest Change Detection.” Theory of Probability & Its Applications 49 (3): 458–497. https://doi.org/10.1137/S0040585X97981202.
   Web of Science ®Google Scholar
• Unnikrishnan, Jayakrishnan, Venugopal V. Veeravalli, and Sean P. Meyn. 2011. “Minimax Robust Quickest Change Detection.” IEEE Transactions on Information Theory 57 (3): 1604–1614. https://doi.org/10.1109/TIT.2011.2104993.
   Web of Science ®Google Scholar
• Veeravalli, Venugopal V., and Taposh Banerjee. 2014. “Quickest Change Detection.” In Academic Press Library in Signal Processing, Vol. 3, 209–255. Elsevier. https://www.sciencedirect.com/bookseries/academic-press-library-in-signal-processing.
   Google Scholar
• Vincent, Pascal. 2011. “A Connection between Score Matching and Denoising Autoencoders.” Neural Computation 23 (7): 1661–1674. https://doi.org/10.1162/NECO_a_00142.
   PubMed Web of Science ®Google Scholar
• Woodroofe, Michael. 1982. Nonlinear Renewal Theory in Sequential Analysis. Philadelphia, PA: SIAM.
   Google Scholar
• Wu, Suya, Enmao Diao, Taposh Banerjee, Jie Ding, and Vahid Tarokh. 2023a. “Robust Quickest Change Detection for Unnormalized Models.” Conference on Uncertainty in Artificial Intelligence (UAI), Pittsburgh, PA.
   Google Scholar
• Wu, Suya, Enmao Diao, Taposh Banerjee, Jie Ding, and Vahid Tarokh. 2023b. “Score-Based Change Point Detection for Unnormalized Models.” International Conference on Artificial Intelligence and Statistics (AISTATS), Valencia, Spain.
   Google Scholar
• Wu, Suya, Enmao Diao, Taposh Banerjee, Jie Ding, and Vahid Tarokh. 2024. “Quickest Change Detection for Unnormalized Statistical Models.” IEEE Transactions on Information Theory 70 (2): 1220–1232. https://doi.org/10.1109/TIT.2023.3328274.
   Web of Science ®Google Scholar
• Xie, Liyan, Shaofeng Zou, Yao Xie, and Venugopal V. Veeravalli. 2021. “Sequential (Quickest) Change Detection: Classical Results and New Directions.” IEEE Journal on Selected Areas in Information Theory 2 (2): 494–514. https://doi.org/10.1109/JSAIT.2021.3072962.
   Google Scholar