arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0801.2624math.STstat.TH
收藏

一类特殊隐马尔可夫链转移密度的最小二乘型估计

Least squares type estimation of the transition density of a particular hidden Markov chain

Claire Lacour

摘要:

本文研究了如下隐马尔可夫链模型:$Y_i=X_i+ε_i$,$i=1,...,n+1$,其中$(X_i)$是实值平稳马尔可夫链,$(ε_i)_{1\leq i\leq n+1}$是具有已知分布且与序列$(X_i)$无关的噪声.我们提出了一个估计的过渡密度通过最小化的原始对比度,利用回归方面的问题。它是用模型选择方法从一组投影估计量中选出的。对一般的平滑噪声估计了$L^2$ -风险和它的收敛速率,并通过一些仿真说明了该方法。我们得到了Besov球类上的一致风险界。此外,我们的估计过程不需要真正的过渡的规律性的先验知识。最后,我们的估计允许避免商估计的缺点。

英文摘要:

In this paper, we study the following model of hidden Markov chain: $Y_i=X_i+ε_i$, $i=1,...,n+1$ with $(X_i)$ a real-valued stationary Markov chain and $(ε_i)_{1\leq i\leq n+1}$ a noise having a known distribution and independent of the sequence $(X_i)$. We present an estimator of the transition density obtained by minimization of an original contrast that takes advantage of the regressive aspect of the problem. It is selected among a collection of projection estimators with a model selection method. The $L^2$-risk and its rate of convergence are evaluated for ordinary smooth noise and some simulations illustrate the method. We obtain uniform risk bounds over classes of Besov balls. In addition our estimation procedure requires no prior knowledge of the regularity of the true transition. Finally, our estimator permits to avoid the drawbacks of quotient estimators.

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

↑