mlsanityData to 7 Oct 2026

Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark

arXiv 2106.01954 ↗First posted 3 Jun 2021cs.LGcited by 95

Not on the map. Why?

Abstract (arXiv)

Despite the recent popularity of neural network-based solvers for optimal transport (OT), there is no standard quantitative way to evaluate their performance. In this paper, we address this issue for quadratic-cost transport -- specifically, computation of the Wasserstein-2 distance, a commonly-used formulation of optimal transport in machine learning. To overcome the challenge of computing ground truth transport maps between continuous measures needed to assess these solvers, we use input-convex neural networks (ICNN) to construct pairs of measures whose ground truth OT maps can be obtained analytically. This strategy yields pairs of continuous benchmark measures in high-dimensional spaces such as spaces of images. We thoroughly evaluate existing optimal transport solvers using these benchmark measures. Even though these solvers perform well in downstream tasks, many do not faithfully recover optimal transport maps. To investigate the cause of this discrepancy, we further test the solvers in a setting of image generation. Our study reveals crucial limitations of existing solvers and shows that increased OT accuracy does not necessarily correlate to better results downstream.

Key facts. Cited by 95 papers in the map (data through 7 Oct 2026). Builds on 29 of its 50 references that are in the map. First posted on arXiv 3 Jun 2021.

Builds on

29 of 50 references.

References · 29

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  3. 2017Improved Training of Wasserstein GANscited by 2,223
  4. 2018Computational Optimal Transportcited by 765
  5. 2017Wasserstein GANcited by 635
  6. 2016Input Convex Neural Networkscited by 407
  7. 2017Are GANs Created Equal? A Large-Scale Studycited by 267
  8. 2019Optimal transport mapping via input convex neural networkscited by 202
  9. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  10. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
  11. 2017The Cramer Distance as a Solution to Biased Wasserstein Gradientscited by 116
  12. 2019Wasserstein-2 Generative Networkscited by 96
17 more
  1. 2017Continuously Differentiable Exponential Linear Unitscited by 73
  2. 2018On the Convergence and Robustness of Training GANs with Regularized Optimal Transportcited by 51
  3. 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 50
  4. 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 49
  5. 2021Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)cited by 33
  6. 20192-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANscited by 32
  7. 2019Multi-marginal Wasserstein GANcited by 32
  8. 2019On Scalable and Efficient Computation of Large Scale Optimal Transportcited by 29
  9. 2017Wasserstein Divergence for GANscited by 22
  10. 2016DOTmark - A Benchmark for Discrete Optimal Transportcited by 15
  11. 2019How Well Do WGANs Estimate the Wasserstein Metric?cited by 15
  12. 2020Large-Scale Optimal Transport via Adversarial Training with Cycle-Consistencycited by 14
  13. 2019A gradual, semi-discrete approach to generative network training via explicit Wasserstein minimizationcited by 12
  14. 2019Adversarial Computation of Optimal Transport Mapscited by 12
  15. 2019(q,p)-Wasserstein GANs: Comparing Ground Metrics for Wasserstein GANscited by 10
  16. 2021Learning High Dimensional Wasserstein Geodesicscited by 10
  17. 2019On the estimation of the Wasserstein distance in generative modelscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 17; 2023: 22; 2024: 15; 2025: 21; 2026: 16.

95 papers.

Sort:

By area:

  1. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
  2. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
  3. 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transportcited by 277
  4. 2022Neural Optimal Transportcited by 123
  5. 2021Generative Modeling with Optimal Transport Mapscited by 80
  6. 2024Optimal Flow Matching: Learning Straight Trajectories in Just One Stepcited by 74
  7. 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
  8. 2022Supervised Training of Conditional Monge Mapscited by 60
  9. 2022Entropic Neural Optimal Transport via Diffusion Processescited by 49
  10. 2023A Computational Framework for Solving Wasserstein Lagrangian Flowscited by 43
  11. 2021Neural Monge Map estimation and its applicationscited by 40
  12. 2023Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transportcited by 39
38 more
  1. 2022Neural Optimal Transport with General Cost Functionalscited by 34
  2. 2023The Monge Gap: A Regularizer to Learn All Transport Mapscited by 32
  3. 2023Unbalancedness in Neural Monge Maps Improves Unpaired Domain Translationcited by 32
  4. 2022Kernel Neural Optimal Transportcited by 31
  5. 2022On amortizing convex conjugates for optimal transportcited by 30
  6. 2022Meta Optimal Transportcited by 28
  7. 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Surveycited by 27
  8. 2023Conditional Optimal Transport on Function Spacescited by 26
  9. 2022Wasserstein Iterative Networks for Barycenter Estimationcited by 23
  10. 2021Efficient Gradient Flows in Sliced-Wasserstein Spacecited by 21
  11. 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?cited by 19
  12. 2023Building the Bridge of Schr"odinger: A Continuous Entropic Optimal Transport Benchmarkcited by 19
  13. 2023Light Schr"odinger Bridgecited by 18
  14. 2022Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplingscited by 16
  15. 2024Neural Optimal Transport with Lagrangian Costscited by 16
  16. 2023Explaining and Adapting Graph Conditional Shiftcited by 14
  17. 2024Estimating Barycenters of Distributions with Neural Optimal Transportcited by 14
  18. 2022An Optimal Transport Perspective on Unpaired Image Super-Resolutioncited by 12
  19. 2023Extremal Domain Translation with Neural Optimal Transportcited by 12
  20. 2023Energy-Guided Continuous Entropic Barycenter Estimation for General Costscited by 12
  21. 2022Fast Nonlinear Vector Quantile Regressioncited by 11
  22. 2024Progressive Entropic Optimal Transport Solverscited by 10
  23. 2025On Fitting Flow Models with Large Sinkhorn Couplingscited by 10
  24. 2024Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transportcited by 9
  25. 2023Light Unbalanced Optimal Transportcited by 8
  26. 2023Computing high-dimensional optimal transport by flow neural networkscited by 8
  27. 2024Neural Sinkhorn Gradient Flowcited by 8
  28. 2025Hierarchical Refinement: Optimal Transport to Infinity and Beyondcited by 8
  29. 2021Variational Wasserstein Barycenters with c-Cyclical Monotonicitycited by 7
  30. 2023Diffeomorphic Mesh Deformation via Efficient Optimal Transport for Cortical Surface Reconstructioncited by 7
  31. 2024Improving Neural Optimal Transport via Displacement Interpolationcited by 7
  32. 2022Turning Normalizing Flows into Monge Maps with Geodesic Gaussian Preserving Flowscited by 6
  33. 2023Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problemcited by 6
  34. 2023Learning Elastic Costs to Shape Monge Displacementscited by 6
  35. 2024ENOT: Expectile Regularization for Fast and Accurate Training of Neural Optimal Transportcited by 6
  36. 2025Convexity in ReLU Neural Networks: beyond ICNNs?cited by 6
  37. 2025Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport Plancited by 6
  38. 2025Learning of Population Dynamics: Inverse Optimization Meets JKO Schemecited by 6

50 most cited of 95 All 95 (JSON)