Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. An efficient interpolation technique for jump proposals in reversible-jump Markov chain Monte Carlo calculations

An efficient interpolation technique for jump proposals in reversible-jump Markov chain Monte Carlo calculations

Thumbnail Image
Download
Name

Farr-2015-An efficient interpo.pdf

Size

1.5 MB

Format

Adobe PDF

Checksum (MD5)

c1d7c23a370ea96ade0d77c2b6e33136

Author(s)
Farr, W. M.
•
Stevens, D.
•
Mandel, Ilya
Date Issued
June 2015
Journal
Royal Society Open Science
Publisher
Royal Society
Citation
Farr, W. M., I. Mandel, and D. Stevens. “An Efficient Interpolation Technique for Jump Proposals in Reversible-Jump Markov Chain Monte Carlo Calculations.” Royal Society Open Science 2, no. 6 (June 2015): 150030.
Version
Final published version
Abstract
Selection among alternative theoretical models given an observed dataset is an important challenge in many areas of physics and astronomy. Reversible-jump Markov chain Monte Carlo (RJMCMC) is an extremely powerful technique for performing Bayesian model selection, but it suffers from a fundamental difficulty and it requires jumps between model parameter spaces, but cannot efficiently explore both parameter spaces at once. Thus, a naive jump between parameter spaces is unlikely to be accepted in the Markov chain Monte Carlo (MCMC) algorithm and convergence is correspondingly slow. Here, we demonstrate an interpolation technique that uses samples from single-model MCMCs to propose intermodel jumps from an approximation to the single-model posterior of the target parameter space. The interpolation technique, based on a kD-tree data structure, is adaptive and efficient in modest dimensionality. We show that our technique leads to improved convergence over naive jumps in an RJMCMC, and compare it to other proposals in the literature to improve the convergence of RJMCMCs. We also demonstrate the use of the same interpolation technique as a way to construct efficient ‘global’ proposal distributions for single-model MCMCs without prior knowledge of the structure of the posterior distribution, and discuss improvements that permit the method to be used in higher dimensional spaces efficiently.
MIT Department
MIT Kavli Institute for Astrophysics and Space Research
Terms of Use
Creative Commons Attribution
http://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/100817
DOI of Published Version
https://doi.org/10.1098/rsos.150030
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.