Ensemble-Based Annealed Importance Sampling
Not on the map. Why?
Abstract (arXiv)
Sampling from a multimodal distribution is a fundamental and challenging problem in computational science and statistics. Among various approaches proposed for this task, one popular method is Annealed Importance Sampling (AIS). In this paper, we propose an ensemble-based version of AIS by combining it with population-based Monte Carlo methods to improve its efficiency. By keeping track of an ensemble instead of a single particle along some continuation path between the starting distribution and the target distribution, we take advantage of the interaction within the ensemble to encourage the exploration of undiscovered modes. Specifically, our main idea is to utilize either the snooker algorithm or the genetic algorithm used in Evolutionary Monte Carlo. We discuss how the proposed algorithm can be implemented and derive a partial differential equation governing the evolution of the ensemble under the continuous time and mean-field limit. We also test the efficiency of the proposed algorithm on various continuous and discrete distributions.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 34 of its 103 references that are in the map. First posted on arXiv 28 Jan 2024.
Builds on
34 of 103 references.
References · 34
- 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 897
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
- 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
- 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
- 2023Denoising Diffusion Samplerscited by 144
- 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
- 2022Flow Annealed Importance Sampling Bootstrapcited by 124
- 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 117
- 2022Score-Based Diffusion meets Annealed Importance Samplingcited by 51
- 2019Accelerating Langevin Sampling with Birth-deathcited by 45
- 2021Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Samplingcited by 44
22 more
- 2019Accelerated Information Gradient flowcited by 38
- 2021Differentiable Annealed Importance Sampling and the Perils of Gradient Noisecited by 36
- 2018Scaling limit of the Stein variational gradient descent: the mean field regimecited by 35
- 2022Birth-death dynamics for sampling: Global convergence, approximations and their asymptoticscited by 30
- 2024Sampling in Unit Time with Kernel Fisher-Rao Flowcited by 27
- 2015The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Methodcited by 26
- 2023Sampling via Gradient Flows in the Space of Probability Measurescited by 20
- 2016On the Geometric Ergodicity of Hamiltonian Monte Carlocited by 19
- 2016Ensemble preconditioning for Markov chain Monte Carlo simulationcited by 16
- 2023Efficient Training of Energy-Based Models Using Jarzynski Equalitycited by 15
- 2017Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributionscited by 12
- 2019Learning Deep Generative Models with Annealed Importance Samplingcited by 8
- 2023Generative Modeling via Hierarchical Tensor Sketchingcited by 8
- 2022Second Order Ensemble Langevin Method for Sampling and Inverse Problemscited by 6
- 2020Complexity of zigzag sampling algorithm for strongly log-concave distributionscited by 5
- 2022A gradient-free subspace-adjusting ensemble sampler for infinite-dimensional Bayesian inverse problemscited by 5
- 2022Free Energy Evaluation Using Marginalized Annealed Importance Samplingcited by 5
- 2022Learning Optimal Flows for Non-Equilibrium Importance Samplingcited by 4
- 2022High-dimensional density estimation with tensorizing flowcited by 4
- 2023Accelerate Langevin Sampling with Birth-Death Process and Exploration Componentcited by 4
- 2021Annealed Leap-Point Sampler for Multimodal Target Distributionscited by 2
- 2020Spatial Monte Carlo Integration with Annealed Importance Samplingcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 3.
4 papers.
- 2025Solving Inverse Problems via Diffusion-Based Priors: An Approximation-Free Ensemble Sampling Approachcited by 18
- 2025Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyondcited by 11
- 2024Efficient, Multimodal, and Derivative-Free Bayesian Inference With Fisher-Rao Gradient Flowscited by 9
- 2025New affine invariant ensemble samplers and their dimensional scalingcited by 3
- 2025Solving Inverse Problems via Diffusion-Based Priors: An Approximation-Free Ensemble Sampling Approach4 Jun 2025
- 2025New affine invariant ensemble samplers and their dimensional scaling5 May 2025
- 2025Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyond7 Feb 2025
- 2024Efficient, Multimodal, and Derivative-Free Bayesian Inference With Fisher-Rao Gradient Flows25 Jun 2024