Back to search

University of British Columbia

Automatic massively parallel Markov chain Monte Carlo with quantifiable error

Abstract

dc:description

Simulated Tempering (ST) is an MCMC algorithm for complex target distributions that operates on a path between the target and an amenable reference distribution. Crucially, if the reference enables i.i.d. sampling, ST is regenerative and therefore embarrassingly parallel. However, the difficulty of tuning ST has hindered its widespread adoption. In this work, we develop a simple nonreversible ST (NRST) algorithm, a general theoretical analysis of ST, and an automated tuning procedure for ST. A core contribution that arises from the analysis is a novel performance metric—Tour Effectiveness (TE)—that controls the asymptotic variance of estimates from ST for bounded test functions. We use the TE to show that NRST dominates its reversible counterpart. We then develop an automated tuning procedure for NRST algorithms that targets the TE while minimizing computational cost. This procedure enables straightforward integration of NRST into existing probabilistic programming languages. We provide extensive experimental evidence that our tuning scheme improves the performance and robustness of NRST algorithms on a diverse set of probabilistic models. NRST can be seen as a meta-MCMC algorithm, in that an explorer Markov chain is required to make local moves within distributions in the path, while NRST orchestrates movement along the path. An ideal explorer must not break down when the distribution that it targets is altered. In our experiments, the Slice Sampler proved to be reliable on an array of models; however, it suffers from poor dimensional scaling. In contrast, gradient-based methods like Metropolis-adjusted Langevin algorithm (MALA) scale favorably with dimension. However, MALA depends critically on a step size parameter, and tuning it requires too much work to be useful for NRST. To resolve this issue we introduce autoMALA, an improved version of MALA that automatically sets its step size at each iteration based on the local geometry of the target distribution. We prove that autoMALA preserves the target measure despite continual adjustments of the step size. Our experiments demonstrate that autoMALA is competitive with related state-of-the-art MCMC methods, in terms of the number of density evaluations per effective sample, and it outperforms state-of-the-art samplers on targets with varying geometries.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy - PhD
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Statistics
Grantor dc:publisher
University of British Columbia
Year dc:date
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Biron Lattes, Miguel
Contributors dc:contributor
  • Bouchard-Côté, Alexandre
  • Campbell, Trevor (Professor of statistics)

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/88656

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Biron Lattes, Miguel. Automatic massively parallel Markov chain Monte Carlo with quantifiable error. doctoral thesis, University of British Columbia, 2024. http://hdl.handle.net/2429/88656