mlsanityData to 7 Oct 2026

Wasserstein Gradient Flows and Forward-Only Diffusion Are Not Enough for Multimodal Sampling

arXiv 2610.02081 ↗First posted 1 Oct 2026stat.ML cs.LG math-phcited by 0

Not on the map. Why?

Abstract (arXiv)

There has been a proliferation of sampling algorithms based on Wasserstein gradient flows (WGF) and forward-only diffusion processes (FODP), often accompanied by theoretical guarantees of exponentially fast convergence to the target distribution. These guarantees are frequently interpreted as evidence that such methods can efficiently sample complex multimodal distributions, often supported by empirical results. In this work, we argue that this interpretation is fundamentally misleading. By invoking the Jordan-Kinderlehrer-Otto (JKO) scheme and Otto calculus, we establish that the canonical WGF sampling dynamics and overdamped forward diffusion share the same density evolution and therefore inherit the same metastability and slow-mixing phenomena long understood in nonequilibrium statistical physics. We analyze this family of samplers using two complementary tools -- spectral analysis and mean first-passage time (MFPT) analysis -- and show that well-separated multimodality can induce exponentially long mixing times associated with small spectral gaps and rare inter-mode transitions. For the commonly adopted log-linear annealing schedule studied here, we find that introducing intermediate distributions does not remove the exponential scaling of the total transport time. The limitation is structural rather than implementation-specific: purely local, gradient-driven transport mechanisms can require exponentially long times to transport probability mass across well-separated modes. We argue that this represents a fundamental limitation of WGF- and FODP-based sampling in their standard forms, and motivates future development of fundamentally nonlocal mechanisms for efficient multimodal sampling.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 62 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

24 of 62 references.

References · 24

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  4. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  5. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  6. 2021Path Integral Sampler: a stochastic control approach for samplingcited by 175
  7. 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
  8. 2023Denoising Diffusion Samplerscited by 144
  9. 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
  10. 2018Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problemcited by 123
  11. 2023Improved sampling via learned diffusionscited by 103
  12. 2021Annealed Flow Transport Monte Carlocited by 90
12 more
  1. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 83
  2. 2021Large-Scale Wasserstein Gradient Flowscited by 76
  3. 2022Continual Repeated Annealed Flow Transport Monte Carlocited by 66
  4. 2021Kernel Stein Discrepancy Descentcited by 57
  5. 2020Projected Stein Variational Gradient Descentcited by 33
  6. 2024Liouville Flow Importance Samplercited by 25
  7. 2021Annealed Stein Variational Gradient Descentcited by 24
  8. 2021Projected Wasserstein gradient descent for high-dimensional Bayesian inferencecited by 24
  9. 2020Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Planscited by 8
  10. 2026Bridge Matching Sampler: Scalable Sampling via Generalized Fixed-Point Diffusion Matchingcited by 7
  11. 2025Score-based deterministic density samplingcited by 4
  12. 2023Improving Estimation of the Koopman Operator with Kolmogorov-Smirnov Indicator Functionscited by 1

Built on by

Not cited yet.