Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark
Alexander Korotin, Lingxiao Li, Aude Genevay, Justin M. Solomon, Alexander Filippov, Evgeny Burnaev
Abstract
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 inputconvex 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. Solving optimal transport (OT) with continuous methods has become widespread in machine learning, including methods for large-scale OT [11, 36] and the popular Wasserstein Generative Adversarial Network (W-GAN) [3, 12] . Rather than discretizing the problem [31], continuous OT algorithms use neural networks or kernel expansions to estimate transport maps or dual solutions. This helps scale OT to large-scale and higher-dimensional problems not handled by discrete methods. Notable successes of continuous OT are in generative modeling [42, 20, 19, 7] and domain adaptation [43, 37, 25] . In these applications, OT is typically incorporated as part of the loss terms for a neural network model. For example, in W-GANs, the OT cost is used as a loss function for the generator; the model incorporates a neural network-based OT solver to estimate the loss. Although recent W-GANs provide state-of-the-art generative performance, however, it remains unclear to which extent this success is connected to OT. For example, [28, 32, 38] show that popular solvers for the Wasserstein-1 Preprint.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f7c8bc62-3343-4e50-ac6c-dbf9e0e7efb5Cited by top-tier papers47
- Neural Optimal TransportAlexander Korotin, Daniil Selikhanovych, Evgeny BurnaevICLR 2023 · 151 citations
- Supervised Training of Conditional Monge MapsCharlotte Bunne, Andreas Krause, Marco CuturiNeurIPS 2022 · 95 citations
- Optimal Flow Matching: Learning Straight Trajectories in Just One StepNikita Kornilov, Petr Mokrov, Alexander V. Gasnikov, Alexander KorotinNeurIPS 2024 · 93 citations
- Generative Modeling with Optimal Transport MapsLitu Rout, Alexander Korotin, Evgeny BurnaevICLR 2022 · 92 citations
- Entropic Neural Optimal Transport via Diffusion ProcessesNikita Gushchin, Alexander Kolesov, Alexander Korotin, Dmitry P. Vetrov et al.NeurIPS 2023 · 59 citations
Builds on5
- Optimal transport mapping via input convex neural networksAshok Vardhan Makkuva, Amirhossein Taghvaei, Sewoong Oh, Jason D. LeeICML 2020 · 254 citations
- Wasserstein-2 Generative NetworksAlexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin et al.ICLR 2021 · 128 citations
- Wasserstein GAN With Quadratic Transport CostHuidong Liu, Xianfeng Gu, Dimitris SamarasICCV 2019 · 104 citations
- Scalable Computations of Wasserstein Barycenter via Input Convex Neural NetworksYongxin Chen, Jiaojiao Fan, Amirhossein TaghvaeiICML 2021 · 66 citations
- Continuous Wasserstein-2 Barycenter Estimation without Minimax OptimizationAlexander Korotin, Lingxiao Li, Justin Solomon, Evgeny BurnaevICLR 2021 · 58 citations
Related papers
- Kernel Neural Optimal TransportAlexander Korotin, Daniil Selikhanovych, Evgeny BurnaevICLR 2023 · 10 citations
- The Monge Gap: A Regularizer to Learn All Transport MapsThéo Uscidda, Marco CuturiICML 2023 · 40 citations
- Parameter tuning and model selection in Optimal Transport with semi-dual Brenier formulationAdrien Vacher, François-Xavier VialardNeurIPS 2022 · 7 citations
- A Statistical Learning Perspective on Semi-dual Adversarial Neural Optimal Transport SolversRoman Tarasov, Petr Mokrov, Milena Gazdieva, Evgeny Burnaev et al.ICLR 2026 · 2 citations
- Neural Optimal Transport with General Cost FunctionalsArip Asadulaev, Alexander Korotin, Vage Egiazarian, Petr Mokrov et al.ICLR 2024 · 43 citations
