UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Designing Simple and Efficient Markov Chain Monte Carlo Proposal Kernels

Thawornwattana, Y; Dalquen, D; Yang, Z; (2018) Designing Simple and Efficient Markov Chain Monte Carlo Proposal Kernels. Bayesian Analysis , 13 (4) pp. 1037-1063. 10.1214/17-BA1084. Green open access

[thumbnail of Yang_Designing simple and efficient Markov chain Monte Carlo proposal kernels_VoR.pdf]
Preview
Text
Yang_Designing simple and efficient Markov chain Monte Carlo proposal kernels_VoR.pdf

Download (593kB) | Preview

Abstract

We discuss a few principles to guide the design of efficient Metropolis–Hastings proposals for well-behaved target distributions without deeply divided modes. We illustrate them by developing and evaluating novel proposal kernels using a variety of target distributions. Here, efficiency is measured by the variance ratio relative to the independent sampler. The first principle is to introduce negative correlation in the MCMC sample or to reduce positive correlation: to propose something new, propose something different. This explains why single-moded proposals such as the Gaussian random-walk is poorer than the uniform random walk, which is in turn poorer than the bimodal proposals that avoid values very close to the current value. We evaluate three new bimodal proposals called Box, Airplane and StrawHat, and find that they have similar performance to the earlier Bactrian kernels, suggesting that the general shape of the proposal matters, but not the specific distributional form. We propose the “Mirror” kernel, which generates new values around the mirror image of the current value on the other side of the target distribution (effectively the “opposite” of the current value). This introduces negative correlations, leading in many cases to efficiency of >100%>. The second principle, applicable to multidimensional targets, is that a sequence of well-designed one-dimensional proposals can be more efficient than a single d-dimensional proposal. Thirdly, we suggest that variable transformation be explored as a general strategy for designing efficient MCMC kernels. We apply these principles to a high-dimensional Gaussian target with strong correlations, a logistic regression problem and a molecular clock dating problem to illustrate their practical utility.

Type: Article
Title: Designing Simple and Efficient Markov Chain Monte Carlo Proposal Kernels
Open access status: An open access version is available from UCL Discovery
DOI: 10.1214/17-BA1084
Publisher version: http://dx.doi.org/10.1214/17-BA1084
Language: English
Additional information: © 2017 International Society for Bayesian Analysis. This is an Open Access article published under a Creative Commons Attribution 4.0 International (CC BY 4.0) Licence (https://creativecommons.org/licenses/by/4.0/).
Keywords: asymptotic variance, bimodal kernel, Metropolis–Hastings algorithm, Mirror kernel, molecular clock dating, variable transformation
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > School of Life and Medical Sciences
UCL > Provost and Vice Provost Offices > School of Life and Medical Sciences > Faculty of Life Sciences
UCL > Provost and Vice Provost Offices > School of Life and Medical Sciences > Faculty of Life Sciences > Div of Biosciences
UCL > Provost and Vice Provost Offices > School of Life and Medical Sciences > Faculty of Life Sciences > Div of Biosciences > Genetics, Evolution and Environment
URI: https://discovery.ucl.ac.uk/id/eprint/10027890
Downloads since deposit
59Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item