On Asymptotic Optimality in Sequential Changepoint Detection: Non-iid Case
Alexander G. Tartakovsky

TL;DR
This paper proves that the Shiryaev change detection procedure is nearly optimal in non-iid stochastic models under r-complete convergence, extending previous asymptotic theories and relaxing stability assumptions.
Contribution
It justifies the conjecture that r-complete convergence suffices for asymptotic optimality of the Shiryaev procedure in non-iid models.
Findings
Shiryaev procedure is asymptotically nearly optimal under r-complete convergence.
The paper extends asymptotic theory to non-iid models with dependent data.
It studies properties of Shiryaev-Roberts detection in Bayesian settings.
Abstract
We consider a sequential Bayesian changepoint detection problem for a general stochastic model, assuming that the observed data may be dependent and non-identically distributed and the prior distribution of the change point is arbitrary, not necessarily geometric. Tartakovsky and Veeravalli (2004) developed a general asymptotic theory of changepoint detection in the non-iid case and discrete time, and Baron and Tartakovsky (2006) in continuous time assuming certain stability of the log-likelihood ratio process. This stability property was formulated in terms of the r-quick convergence of the normalized log-likelihood ratio process to a positive and finite number, which can be interpreted as the limiting Kullback-Leibler information between the "change" and "no change" hypotheses. In these papers, it was conjectured that the r-quick convergence can be relaxed in the r-complete…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
