arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1505.01434stat.CO
收藏

Markov跳过程的粒子Gibbs算法

Particle Gibbs algorithms for Markov jump processes

Blazej Miasojedow, Wojciech Niemiro

摘要:

本文提出了一种新的MCMC算法,用于从马尔可夫跳过程隐轨迹的后验分布中采样。我们的算法基于Rao和Teh(2013)提出的利用虚拟跳跃的思想。主要的新颖性是,我们的算法使用粒子吉布斯与祖先采样更新骨架,而Rao和Teh使用前向滤波后向采样(FFBS)。与以前的方法相比,我们的算法可以实现,即使状态空间是无限的。此外,所提出的算法的单个步骤的成本不依赖于状态空间的大小。我们的方法的计算成本是$\mathcal{O}(N\mathbb{E}(n))$阶,其中$N$是PGAS算法中使用的粒子数,$\mathbb{E}(n)$是期望的跳跃数(连同虚拟的)。Rao和Teh的算法的成本是$\mathcal{O}(|\mathcal{X}|^2\mathbb{E}(n))$阶,其中$|\mathcal{X}|$是状态空间的大小。仿真结果表明,在状态空间不大的情况下,PGAS算法的收敛速度比FFBS算法稍慢。然而,如果状态空间的大小增加,所提出的方法优于现有的。我们特别注意我们的算法,可应用于连续时间贝叶斯网络(CTBN)的层次版本。

英文摘要:

In the present paper we propose a new MCMC algorithm for sampling from the posterior distribution of hidden trajectory of a Markov jump process. Our algorithm is based on the idea of exploiting virtual jumps, introduced by Rao and Teh (2013). The main novelty is that our algorithm uses particle Gibbs with ancestor sampling to update the skeleton, while Rao and Teh use forward filtering backward sampling (FFBS). In contrast to previous methods our algorithm can be implemented even if the state space is infinite. In addition, the cost of a single step of the proposed algorithm does not depend on the size of the state space. The computational cost of our methood is of order $\mathcal{O}(N\mathbb{E}(n))$, where $N$ is the number of particles used in the PGAS algorithm and $\mathbb{E}(n)$ is the expected number of jumps (together with virtual ones). The cost of the algorithm of Rao and Teh is of order $\mathcal{O}(|\mathcal{X}|^2\mathbb{E}(n))$, where $|\mathcal{X}|$ is the size of the state space. Simulation results show that our algorithm with PGAS converges slightly slower than the algorithm with FFBS, if the size of the state space is not big. However, if the size of the state space increases, the proposed method outperforms existing ones. We give special attention to a hierarchical version of our algorithm which can be applied to continuous time Bayesian networks (CTBNs).

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

↑