Annealed Leap-Point Sampler for Multimodal Target Distributions
Nicholas G. Tawn, Matthew T. Moores, Hugo Queniat, Gareth O. Roberts
TL;DR
ALPS introduces a scalable framework for sampling high-dimensional multimodal posteriors by augmenting the target with Hessian-informed annealed densities (HAT) and coupling this with a mode-exploration component. The two-core components, ALPS-PA and ALPS-EC, enable non-local mode jumping via a Hessian-based Gaussian mixture proxy and adaptive mode discovery, respectively, while QuanTA-swaps improve temperature-space mixing. Theoretical results show that the coldest temperature level can scale linearly with dimension, $\beta_{\max}=O(d)$, delivering a mixing time of $\mathcal{O}(d)$ for the annealed process and an overall computational cost of $\mathcal{O}(d^3)$; empirically, ALPS demonstrates robust mode discovery and sampling in synthetic, SUR, and spectral-density problems, outperforming traditional parallel tempering and Laplace-approximation-based methods. The work provides a practical, polynomial-time approach to multimodal Bayesian inference in high dimensions with concrete guidance on temperature schedules and mode-finding, and it opens avenues for robustness improvements and extensions to broader model classes.
Abstract
In Bayesian statistics, exploring high-dimensional multimodal posterior distributions poses major challenges for existing MCMC approaches. This paper introduces the Annealed Leap-Point Sampler (ALPS), which augments the target distribution state space with modified annealed (cooled) distributions, in contrast to traditional tempering approaches. The coldest state is chosen such that its annealed density is well-approximated locally by a Laplace approximation. This allows for automated setup of a scalable mode-leaping independence sampler. ALPS requires an exploration component to search for the mode locations, which can either be run adaptively in parallel to improve these mode-jumping proposals, or else as a pre-computation step. A theoretical analysis shows that for a d-dimensional problem the coolest temperature level required only needs to be linear in dimension, $\mathcal{O}\left(d\right)$, implying that the number of iterations needed for ALPS to converge is $\mathcal{O}\left(d\right)$ (typically leading to overall complexity $\mathcal{O}\left(d^3\right)$ when computational cost per iteration is taken into account). ALPS is illustrated on several complex, multimodal distributions that arise from real-world applications. This includes a seemingly-unrelated regression (SUR) model of longitudinal data from U.S. manufacturing firms, as well as a spectral density model that is used in analytical chemistry for identification of molecular biomarkers.
