arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.1042math.PRcs.ITcs.LGmath.IT
收藏

多观测过程隐马尔可夫模型

Hidden Markov Models with Multiple Observation Processes

University of Melbourne(墨尔本大学)

James Y. Zhao

摘要:

我们考虑一个隐马尔可夫模型与多个观察过程,其中之一是选择在每个时间点的政策-信息状态的确定性函数-并试图确定哪些政策最小化的信息状态的限制预期熵。针对一种特殊情况,我们用解析的方法证明了信息态总是按分布收敛的,并导出了一个极限熵的计算公式,该公式可用于高精度的计算。利用这个公式,我们发现在计算上,最优策略总是一个阈值策略,使得它很容易找到。我们还发现,贪婪策略几乎是最优的。

英文摘要:

We consider a hidden Markov model with multiple observation processes, one of which is chosen at each point in time by a policy---a deterministic function of the information state---and attempt to determine which policy minimises the limiting expected entropy of the information state. Focusing on a special case, we prove analytically that the information state always converges in distribution, and derive a formula for the limiting entropy which can be used for calculations with high precision. Using this fomula, we find computationally that the optimal policy is always a threshold policy, allowing it to be easily found. We also find that the greedy policy is almost optimal.

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

↑