mlsanityData to 7 Oct 2026

Neural solver for Wasserstein Geodesics and optimal transport dynamics

arXiv 2602.22003 ↗First posted 25 Feb 2026cs.LG math.OC stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

In recent years, the machine learning community has increasingly embraced the optimal transport (OT) framework for modeling distributional relationships. In this work, we introduce a sample-based neural solver for computing the Wasserstein geodesic between a source and target distribution, along with the associated velocity field. Building on the dynamical formulation of the optimal transport (OT) problem, we recast the constrained optimization as a minimax problem, using deep neural networks to approximate the relevant functions. This approach not only provides the Wasserstein geodesic but also recovers the OT map, enabling direct sampling from the target distribution. By estimating the OT map, we obtain velocity estimates along particle trajectories, which in turn allow us to learn the full velocity field. The framework is flexible and readily extends to general cost functions, including the commonly used quadratic cost. We demonstrate the effectiveness of our method through experiments on both synthetic and real datasets.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 29 of its 58 references that are in the map. First posted on arXiv 25 Feb 2026.

Builds on

29 of 58 references.

References · 29

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2017Improved Training of Wasserstein GANscited by 2,223
  3. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
  4. 2018Computational Optimal Transportcited by 765
  5. 2015Optimal Transport for Domain Adaptationcited by 457
  6. 2016Input Convex Neural Networkscited by 407
  7. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  8. 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
  9. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  10. 2019Optimal transport mapping via input convex neural networkscited by 202
  11. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  12. 2022Neural Optimal Transportcited by 123
17 more
  1. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
  2. 2019Wasserstein-2 Generative Networkscited by 96
  3. 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
  4. 2020A survey on modern trainable activation functionscited by 89
  5. 2021On the approximation of functions by tanh neural networkscited by 81
  6. 2021Generative Modeling with Optimal Transport Mapscited by 80
  7. 2018Improving the Improved Training of Wasserstein GANs: A Consistency Term and Its Dual Effectcited by 49
  8. 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 49
  9. 2021Neural Monge Map estimation and its applicationscited by 40
  10. 2019Multi-marginal Wasserstein GANcited by 32
  11. 2019On Scalable and Efficient Computation of Large Scale Optimal Transportcited by 29
  12. 2019Unnormalized Optimal Transportcited by 15
  13. 2015Optimal transport over a linear dynamical systemcited by 14
  14. 2020Large-Scale Optimal Transport via Adversarial Training with Cycle-Consistencycited by 14
  15. 2019Adversarial Computation of Optimal Transport Mapscited by 12
  16. 2020Optimal Transport-based Coverage Control for Swarm Robot Systems: Generalization of the Voronoi Tessellation-based Methodcited by 7
  17. 2022GeONet: a neural operator for learning the Wasserstein geodesiccited by 3

Built on by

Not cited yet.