cs.LGNov 3, 2026

Transport along Local Annealing Paths: Wasserstein Geometry and Multimodal Sampling

Authors: Han Chen, Sifan Liu

Organizations: Department of Statistical Science, Duke University

Abstract

Variational approaches to learning transport maps for multimodal sampling can suffer from mode collapse. One way to mitigate this problem is to learn transport along a prescribed path of intermediate distributions defined by geometric annealing. We show that annealing can take a substantial detour in Wasserstein space: when mass moves between modes, the path can be much longer than the distance between its endpoints. We further link path geometry to transport learning, showing that long annealing paths can slow population optimization, while sufficiently regular paths permit rapid convergence. Motivated by these findings, we propose componentwise annealed transport (CAT) to reduce the need for mass transfer between modes. Starting from a mode-informed mixture reference, CAT constructs an exact mixture decomposition of the target and learns separate transport maps along componentwise annealing paths. We estimate the component weights separately and show that these estimates remain consistent even when the learned flows are inexact. We also develop adaptive annealing schedules guided by transport effort. Experiments on multimodal synthetic distributions and Bayesian inference problems demonstrate improvements in transport learning and sampling efficiency.

Figures & tables

Appendix figures & tables2 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

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

    Oct 1, 2026Daniel McBride, Pratik Khandagale, Cristina Garcia-Cardona +1Dynamical SystemsWasserstein Gradient Flows

  2. Fixed-point acceleration on Neural Wasserstein manifolds

    Nov 6, 2026Vitalii Aksenov, Sebastian Gutierrez HernandezInference AccelerationRiemannian Optimization