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

Baum-Welch算法的信息论推导

A Concise Information-Theoretic Derivation of the Baum-Welch algorithm

Alireza Nejati, Charles Unsworth

摘要:

我们推导出隐马尔可夫模型(HALF)的Baum-Welch算法,通过信息理论的方法,使用交叉熵,而不是拉格朗日乘子的方法,这是普遍的机器学习文献。所提出的方法提供了Baum-Welch方法的更简洁的推导,并自然地推广到多个观测值。

英文摘要:

We derive the Baum-Welch algorithm for hidden Markov models (HMMs) through an information-theoretical approach using cross-entropy instead of the Lagrange multiplier approach which is universal in machine learning literature. The proposed approach provides a more concise derivation of the Baum-Welch method and naturally generalizes to multiple observations.

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

↑