Fast MCMC sampling for Markov jump processes and extensions

By Vinayak A. Rao, Yee Whye Teh. 2012

119 citations recorded by the source corpus.

Markov jump processes (or continuous-time Markov chains) are a simple and important class of continuous-time dynamical systems. In this paper, we tackle the problem of simulating from the posterior distribution over paths in these models, given partial and noisy observations. Our approach is an auxiliary variable Gibbs sampler, and is based on the idea of uniformization. This sets up a Markov chain over paths by alternately sampling a finite set of virtual jump times given the current path, and then sampling a new path given the set of extant and virtual jump times. The first step involves simulating a piecewise-constant inhomogeneous Poisson process, while for the second, we use a standard hidden Markov model forward filtering-backward sampling algorithm. Our method is exact and does not involve approximations like time-discretization. We demonstrate how our sampler extends naturally to MJP-based models like Markov-modulated Poisson processes and continuous-time Bayesian networks, and show significant computational benefits over state-of-the-art MCMC samplers for these models.

Subfields: Artificial Intelligence, Spectroscopy, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Spectroscopy

In Statistics and Probability

Citations in the corpus

Increasing the Interpretability of Recurrent Neural Networks Using Hidden Markov Models (2016, methodology): “Sample states using Forward Filtering Backwards Sampling algorithm (FFBS, Rao and Teh (2013)).”