arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.0584cs.AIcs.LGcs.SYeess.SY
收藏

衰减MCMC滤波

Decayed MCMC Filtering

University of California, Berkeley(加州大学伯克利分校)

Bhaskara Marthi, Hanna Pasula, Stuart Russell, Yuval Peres

AI总结:

提出一种基于衰减MCMC的随机近似滤波算法,通过偏向翻转近期状态变量的提议分布对状态轨迹进行采样,并证明在观测序列增长时收敛时间有界,实验表明与粒子滤波等算法性能相当。

摘要:

滤波——从观测序列中估计部分可观测马尔可夫过程的状态——是控制理论、人工智能和计算统计学中研究最广泛的问题之一。对于大型离散系统和非线性连续系统,后验分布的精确计算通常是难以处理的,因此大量工作致力于开发鲁棒的近似算法。本文描述了一种简单的随机近似滤波算法,称为衰减MCMC。该算法对状态轨迹空间应用马尔可夫链蒙特卡罗采样,使用偏向翻转较新状态变量的提议分布。该算法的形式化分析涉及MCMC收敛的标准耦合论证的推广。我们证明,对于任何遍历的底层马尔可夫过程,随着观测序列长度的增长,具有逆多项式衰减的衰减MCMC的收敛时间保持有界。实验表明,衰减MCMC至少与粒子滤波等其他近似算法具有竞争力。

英文摘要:

Filtering---estimating the state of a partially observable Markov process from a sequence of observations---is one of the most widely studied problems in control theory, AI, and computational statistics. Exact computation of the posterior distribution is generally intractable for large discrete systems and for nonlinear continuous systems, so a good deal of effort has gone into developing robust approximation algorithms. This paper describes a simple stochastic approximation algorithm for filtering called {em decayed MCMC}. The algorithm applies Markov chain Monte Carlo sampling to the space of state trajectories using a proposal distribution that favours flips of more recent state variables. The formal analysis of the algorithm involves a generalization of standard coupling arguments for MCMC convergence. We prove that for any ergodic underlying Markov process, the convergence time of decayed MCMC with inverse-polynomial decay remains bounded as the length of the observation sequence grows. We show experimentally that decayed MCMC is at least competitive with other approximation algorithms such as particle filtering.

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

↑