Fast MCMC Sampling for Markov Jump Processes and Continuous Time Bayesian Networks
Abstract
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserved paths in these models by introducing a fast auxiliary variable Gibbs sampler. Our approach is based on the idea of uniformization, and sets up a Markov chain over paths by sampling a finite set of virtual jump times and then running a standard hidden Markov model forward filtering-backward sampling algorithm over states at the set of extant and virtual jump times. We demonstrate significant computational benefits over a state-of-the-art Gibbs sampler on a number of continuous time Bayesian networks.
Cite
Text
Rao and Teh. "Fast MCMC Sampling for Markov Jump Processes and Continuous Time Bayesian Networks." Conference on Uncertainty in Artificial Intelligence, 2011.Markdown
[Rao and Teh. "Fast MCMC Sampling for Markov Jump Processes and Continuous Time Bayesian Networks." Conference on Uncertainty in Artificial Intelligence, 2011.](https://mlanthology.org/uai/2011/rao2011uai-fast/)BibTeX
@inproceedings{rao2011uai-fast,
title = {{Fast MCMC Sampling for Markov Jump Processes and Continuous Time Bayesian Networks}},
author = {Rao, Vinayak A. and Teh, Yee Whye},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2011},
pages = {619-626},
url = {https://mlanthology.org/uai/2011/rao2011uai-fast/}
}