Annealed Leap-Point Sampler for Multimodal Target Distributions

12/24/2021
by   Nicholas G. Tawn, et al.
0

In Bayesian statistics, exploring multimodal posterior distribution poses major challenges for existing techniques such as Markov Chain Monte Carlo (MCMC). These problems are exacerbated in high-dimensional settings where MCMC methods typically rely upon localised proposal mechanisms. This paper introduces the Annealed Leap-Point Sampler (ALPS), which augments the target distribution state space with modified annealed (cooled) target distributions, in contrast to traditional approaches which have employed tempering. The temperature of the coldest state is chosen such that its corresponding annealed target density can be sufficiently well-approximated by a Laplace approximation. As a result, a Gaussian mixture independence Metropolis-Hastings sampler can perform mode-jumping proposals even in high-dimensional problems. The ability of this procedure to "mode hop" at this super-cold state is then filtered through to the target state using a sequence of tempered targets in a similar way to that in parallel tempering methods. ALPS also incorporates the best aspects of current gold-standard approaches to multimodal sampling in high-dimensional contexts. A theoretical analysis of the ALPS approach in high dimensions is given, providing practitioners with a gauge on the optimal setup as well as the scalability of the algorithm. For a d-dimensional problem the it is shown that the coldest inverse temperature level required for the ALPS only needs to be linear in the dimension, 𝒪(d), and this means that for a collection of multimodal problems the algorithmic cost is polynomial, 𝒪(d^3). ALPS is illustrated on a complex multimodal posterior distribution that arises from a seemingly-unrelated regression (SUR) model of longitudinal data from U.S. manufacturing firms.

READ FULL TEXT

page 21

page 24

page 27

research
08/17/2017

Pseudo-extended Markov chain Monte Carlo

Sampling from the posterior distribution using Markov chain Monte Carlo ...
research
05/19/2022

Continuously-Tempered PDMP Samplers

New sampling algorithms based on simulating continuous-time stochastic p...
research
08/30/2018

Accelerating Parallel Tempering: Quantile Tempering Algorithm (QuanTA)

Using MCMC to sample from a target distribution, π(x) on a d-dimensional...
research
09/10/2022

Parallel MCMC Algorithms: Theoretical Foundations, Algorithm Design, Case Studies

Parallel Markov Chain Monte Carlo (pMCMC) algorithms generate clouds of ...
research
06/29/2022

Cyclical Kernel Adaptive Metropolis

We propose cKAM, cyclical Kernel Adaptive Metropolis, which incorporates...
research
10/13/2018

Optimal Temperature Spacing for Regionally Weight-preserving Tempering

Parallel tempering is popular method for allowing MCMC algorithms to pro...
research
04/12/2016

The Matrix Generalized Inverse Gaussian Distribution: Properties and Applications

While the Matrix Generalized Inverse Gaussian (MGIG) distribution arises...

Please sign up or login with your details

Forgot password? Click here to reset