mlsanityData to 7 Oct 2026

Accelerate Langevin Sampling with Birth-Death Process and Exploration Component

arXiv 2305.05529 ↗First posted 6 May 2023stat.CO cs.LG math.PRcited by 4

Not on the map. Why?

Abstract (arXiv)

Sampling a probability distribution with known likelihood is a fundamental task in computational science and engineering. Aiming at multimodality, we propose a new sampling method that takes advantage of both birth-death process and exploration component. The main idea of this method is look before you leap. We keep two sets of samplers, one at warmer temperature and one at original temperature. The former one serves as pioneer in exploring new modes and passing useful information to the other, while the latter one samples the target distribution after receiving the information. We derive a mean-field limit and show how the exploration component accelerates the sampling process. Moreover, we prove exponential asymptotic convergence under mild assumption. Finally, we test on experiments from previous literature and compare our methodology to previous ones.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 36 references that are in the map. First posted on arXiv 6 May 2023.

Builds on

14 of 36 references.

References · 14

  1. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  2. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  3. 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
  4. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 144
  5. 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
  6. 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 117
  7. 2020Structured Logconcave Sampling with a Restricted Gaussian Oraclecited by 85
  8. 2020SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergencecited by 64
  9. 2019Accelerating Langevin Sampling with Birth-deathcited by 45
  10. 2021Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Samplingcited by 44
  11. 2022Birth-death dynamics for sampling: Global convergence, approximations and their asymptoticscited by 30
  12. 2018Gaussian variational approximation for high-dimensional state space modelscited by 10
2 more
  1. 2021Annealed Leap-Point Sampler for Multimodal Target Distributionscited by 2
  2. 2018Accelerating Parallel Tempering: Quantile Tempering Algorithm (QuanTA)cited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 1.

4 papers.