arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.3707cs.AI
收藏

一种时间抽象的Viterbi算法

A temporally abstracted Viterbi algorithm

University of California, Berkeley(加利福尼亚大学伯克利分校)

Shaunak Chatterjee, Stuart Russell

摘要:

分层的问题抽象,在适用的情况下,可以提供计算复杂性的指数级降低。以前的工作,从粗到细的动态规划(CFDP)已经证明了这种可能性,使用状态抽象,以加快维特比算法。在本文中,我们将展示如何应用时间抽象的维特比问题。我们的算法使用来自粗时间尺度的分析修剪大部分的状态网格在更精细的时间尺度的界限。我们证明了几个数量级的改进标准维特比算法,以及显着的加速CFDP,其状态变量在很大程度上不同的速率演变的问题。

英文摘要:

Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demonstrated this possibility using state abstraction to speed up the Viterbi algorithm. In this paper, we show how to apply temporal abstraction to the Viterbi problem. Our algorithm uses bounds derived from analysis of coarse timescales to prune large parts of the state trellis at finer timescales. We demonstrate improvements of several orders of magnitude over the standard Viterbi algorithm, as well as significant speedups over CFDP, for problems whose state variables evolve at widely differing rates.

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

↑