Asymptotic theory of sequential detection and identification in the hidden Markov models

2013/12/11 by Savaş Dayanik, Savas Dayanik, Dayanik, Savas +2
Decision Sciences · Mathematics · #Advanced Statistical Process Monitoring #FOS: Mathematics #Optimization and Control (math.OC) #Probability and Risk Models #Statistical Methods and Inference #Statistics Theory (math.ST) #math.OC #math.ST #stat.TH

paper · pdf · doi:10.48550/arxiv.1312.3352

arxiv created 2013/12/11 · openalex publication_date 2013/12/11 · arxiv updated 2013/12/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider a unified framework of sequential change-point detection and hypothesis testing modeled by means of hidden Markov chains. One observes a sequence of random variables whose distributions are functionals of a hidden Markov chain. The objective is to detect quickly the event that the hidden Markov chain leaves a certain set of states, and to identify accurately the class of states into which it is absorbed. We propose computationally tractable sequential detection and identification strategies and obtain sufficient conditions for the asymptotic optimality in two Bayesian formulations. Numerical examples are provided to confirm the asymptotic optimality and to examine the rate of convergence.

Related

• Detecting Changes in Hidden Markov Models
• Asymptotic Bayesian Theory of Quickest Change Detection for Hidden Markov Models
• Minimax and pointwise sequential changepoint detection and identification for general stochastic models
• On Asymptotic Optimality in Sequential Changepoint Detection: Non-iid Case
• Exactly Optimal Bayesian Quickest Change Detection for Hidden Markov Models