arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0503682math.STstat.TH
收藏

隐马尔可夫模型中最优变点检测的渐近运行特性

Asymptotic operating characteristics of an optimal change point detection in hidden Markov models

Cheng-Der Fuh

摘要:

设_0,_1,.,其中,n_{ω-1}是具有概率分布P^{θ_0}的隐马尔可夫模型的观测值,设n_ω,n_{ω+1},.是来自具有概率分布P^{θ_1}的隐马尔可夫模型的观测值。参数θ_0和θ_1已给出,而变点ω未知。问题是在分布从P^{θ_0}变为P^{θ_1}之后尽快发出警报,但要避免误报。具体地,我们寻求一个停止规则N,该规则允许我们顺序地观察这些连续性,使得E_{\infty} N是大的,并且受到该约束,sup_kE_k(N-k| N \geq k)尽可能小。这里,E_k表示在变化点k下的期望,而E_{\infty}表示在没有任何变化的假设下的期望。在本文中,我们研究的Shiryayev-Roberts-Pollak(SRP)规则的隐马尔可夫模型的动态系统中的变点检测的性能。利用似然函数的马尔可夫链表示、渐近极大极小策略和贝叶斯规则的结构以及马尔可夫随机游动的序列假设检验理论,我们证明了SRP过程在Pollak [Ann. Statist. 13(1985)206-227]。其次,当ω=1时,我们给出了这种停止方案的期望停时的二阶渐近近似。受隐马尔可夫模型中的序贯分析的启发,给出了马尔可夫随机游动的非线性更新理论。

英文摘要:

Let ξ_0,ξ_1,...,ξ_{ω-1} be observations from the hidden Markov model with probability distribution P^{θ_0}, and let ξ_ω,ξ_{ω+1},... be observations from the hidden Markov model with probability distribution P^{θ_1}. The parameters θ_0 and θ_1 are given, while the change point ωis unknown. The problem is to raise an alarm as soon as possible after the distribution changes from P^{θ_0} to P^{θ_1}, but to avoid false alarms. Specifically, we seek a stopping rule N which allows us to observe the ξ's sequentially, such that E_{\infty}N is large, and subject to this constraint, sup_kE_k(N-k|N\geq k) is as small as possible. Here E_k denotes expectation under the change point k, and E_{\infty} denotes expectation under the hypothesis of no change whatever. In this paper we investigate the performance of the Shiryayev-Roberts-Pollak (SRP) rule for change point detection in the dynamic system of hidden Markov models. By making use of Markov chain representation for the likelihood function, the structure of asymptotically minimax policy and of the Bayes rule, and sequential hypothesis testing theory for Markov random walks, we show that the SRP procedure is asymptotically minimax in the sense of Pollak [Ann. Statist. 13 (1985) 206-227]. Next, we present a second-order asymptotic approximation for the expected stopping time of such a stopping scheme when ω=1. Motivated by the sequential analysis in hidden Markov models, a nonlinear renewal theory for Markov random walks is also given.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑