arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.0604stat.COstat.ML
收藏

具有祖先采样的粒子吉布斯

Particle Gibbs with Ancestor Sampling

Fredrik Lindsten, Michael I. Jordan, Thomas B. Schön

摘要:

粒子马尔可夫链蒙特卡罗(Particle Markov chain Monte Carlo,PMCMC)是一种将两种主要的蒙特卡罗统计推断工具结合起来的系统方法:序列蒙特卡罗(Sequential Monte Carlo,SMC)和马尔可夫链蒙特卡罗(Markov chain Monte Carlo,MCMC)。我们提出了一种新的PMCMC算法,我们称之为粒子吉布斯与祖先采样(PGAS)。PGAS为数据分析师提供了一种现成的马尔可夫核,可用于模拟状态空间模型中通常高维和高度自相关的状态轨迹。祖先采样过程即使在底层SMC采样器中使用看似很少的粒子时,也可以快速混合PGAS内核。这很重要,因为它可以显著减少通常与使用SMC相关的计算负担。PGAS在概念上类似于现有的反向模拟PG(PGBS)程序。然而,我们不是像PGBS那样使用单独的前向和后向扫描,而是在单个前向扫描中实现相同的效果。这使得PGAS非常适合解决推理问题,不仅在状态空间模型,而且在模型更复杂的依赖关系,如非马尔可夫,贝叶斯非参数和一般的概率图形模型。

英文摘要:

Particle Markov chain Monte Carlo (PMCMC) is a systematic way of combining the two main tools used for Monte Carlo statistical inference: sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC). We present a novel PMCMC algorithm that we refer to as particle Gibbs with ancestor sampling (PGAS). PGAS provides the data analyst with an off-the-shelf class of Markov kernels that can be used to simulate the typically high-dimensional and highly autocorrelated state trajectory in a state-space model. The ancestor sampling procedure enables fast mixing of the PGAS kernel even when using seemingly few particles in the underlying SMC sampler. This is important as it can significantly reduce the computational burden that is typically associated with using SMC. PGAS is conceptually similar to the existing PG with backward simulation (PGBS) procedure. Instead of using separate forward and backward sweeps as in PGBS, however, we achieve the same effect in a single forward sweep. This makes PGAS well suited for addressing inference problems not only in state-space models, but also in models with more complex dependencies, such as non-Markovian, Bayesian nonparametric, and general probabilistic graphical models.

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

↑