Applying diffusion-based Markov chain Monte Carlo

PLoS One. 2017 Mar 16;12(3):e0173453. doi: 10.1371/journal.pone.0173453. eCollection 2017.

Abstract

We examine the performance of a strategy for Markov chain Monte Carlo (MCMC) developed by simulating a discrete approximation to a stochastic differential equation (SDE). We refer to the approach as diffusion MCMC. A variety of motivations for the approach are reviewed in the context of Bayesian analysis. In particular, implementation of diffusion MCMC is very simple to set-up, even in the presence of nonlinear models and non-conjugate priors. Also, it requires comparatively little problem-specific tuning. We implement the algorithm and assess its performance for both a test case and a glaciological application. Our results demonstrate that in some settings, diffusion MCMC is a faster alternative to a general Metropolis-Hastings algorithm.

MeSH terms

  • Bayes Theorem
  • Markov Chains*
  • Monte Carlo Method*
  • Stochastic Processes

Grants and funding

RH has been supported in part by the National Science Foundation (www.nsf.gov) grant number DMS-1209142. RP has been supported in part by the National Science Foundation (www.nsf.gov) grant NSF-CMMI-1537379. LMB was supported in part by the National Science Foundation (www.nsf.gov) grants ATM-07-3024403 and DMS-10-49064. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.