mlsanityData to 13 Oct 2026

Jump-Diffusion Langevin Dynamics for Multimodal Posterior Sampling

arXiv 2211.01774 ↗First posted 2 Nov 2022stat.ML math.PRcited by 0

Not on the map. Why?

Abstract (arXiv)

Bayesian methods of sampling from a posterior distribution are becoming increasingly popular due to their ability to precisely display the uncertainty of a model fit. Classical methods based on iterative random sampling and posterior evaluation such as Metropolis-Hastings are known to have desirable long run mixing properties, however are slow to converge. Gradient based methods, such as Langevin Dynamics (and its stochastic gradient counterpart) exhibit favorable dimension-dependence and fast mixing times for log-concave, and "close" to log-concave distributions, however also have long escape times from local minimizers. Many contemporary applications such as Bayesian Neural Networks are both high-dimensional and highly multimodal. In this paper we investigate the performance of a hybrid Metropolis and Langevin sampling method akin to Jump Diffusion on a range of synthetic and real data, indicating that careful calibration of mixing sampling jumps with gradient based chains significantly outperforms both pure gradient-based or sampling based schemes.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 6 of its 19 references that are in the map. First posted on arXiv 2 Nov 2022.

Builds on

6 of 19 references.

References · 6

  1. 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 307
  2. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 207
  3. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 145
  4. 2017Convergence of Langevin MCMC in KL-divergencecited by 87
  5. 2018Sampling Can Be Faster Than Optimizationcited by 68
  6. 2019On Stationary-Point Hitting Time and Ergodicity of Stochastic Gradient Langevin Dynamicscited by 14

Built on by

Not cited yet.