Non-Reversible Parallel Tempering: an Embarassingly Parallel MCMC Scheme

05/08/2019
by   Saifuddin Syed, et al.
0

Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to explore complex high-dimensional probability distributions. These algorithms can be highly effective but their performance is contingent on the selection of a suitable annealing schedule. In this work, we provide a new perspective on PT algorithms and their tuning, based on two main insights. First, we identify and formalize a sharp divide in the behaviour and performance of reversible versus non-reversible PT methods. Second, we analyze the behaviour of PT algorithms using a novel asymptotic regime in which the number of parallel compute cores goes to infinity. Based on this approach we show that a class of non-reversible PT methods dominates its reversible counterpart and identify distinct scaling limits for the non-reversible and reversible schemes, the former being a piecewise-deterministic Markov process (PDMP) and the latter a diffusion. In particular, we identify a class of non-reversible PT algorithms which is provably scalable to massive parallel implementation, in contrast to reversible PT algorithms, which are known to collapse in the massive parallel regime. We then bring these theoretical tools to bear on the development of novel methodologies. We develop an adaptive non-reversible PT scheme which estimates the event rate of the limiting PDMP and uses this estimated rate to approximate the optimal annealing schedule. We provide a wide range of numerical examples supporting and extending our theoretical and methodological contributions. Our adaptive non-reversible PT method outperforms experimentally state-of-the-art PT methods in terms of taking less time to adapt, as well as providing better target approximations. Our scheme has no tuning parameters and appears in our simulations robust to violations of the theoretical assumption used to carry out our analysis.

READ FULL TEXT
research
07/07/2018

Note on the convergence time of some non-reversible Markov chain Monte Carlo methods

Introduced in statistical physics, non-reversible Markov chain Monte Car...
research
09/11/2023

Automatic regenerative simulation via non-reversible simulated tempering

Simulated Tempering (ST) is an MCMC algorithm for complex target distrib...
research
01/31/2022

Nonholonomic Newmark method

Using the nonholonomic exponential map, we generalize the well-known fam...
research
03/16/2019

Reversible and non-reversible Markov Chain Monte Carlo algorithms for reservoir simulation problems

We compare numerically the performance of reversible and non-reversible ...
research
11/04/2019

Non-reversible jump algorithms for Bayesian nested model selection

Non-reversible Markov chain Monte Carlo methods often outperform their r...
research
11/05/2020

Non-reversible sampling schemes on submanifolds

Calculating averages with respect to probability measures on submanifold...
research
12/24/2021

Concave-Convex PDMP-based sampling

Recently non-reversible samplers based on simulating piecewise determini...

Please sign up or login with your details

Forgot password? Click here to reset