Expectile Regularization for Fast and Accurate Training of Neural Optimal Transport
Nazar Buzun, Maksim Bobrin, Dmitry V. Dylov
Abstract
We present a new approach for Neural Optimal Transport (NOT) training procedure, capable of accurately and efficiently estimating optimal transportation plan via specific regularization on dual Kantorovich potentials. The main bottleneck of existing NOT solvers is associated with the procedure of finding a near-exact approximation of the conjugate operator (i.e., the c-transform), which is done either by optimizing over non-convex max-min objectives or by the computationally intensive fine-tuning of the initial approximated prediction. We resolve both issues by proposing a new, theoretically justified loss in the form of expectile regularisation which enforces binding conditions on the learning process of dual potentials. Such a regularization provides the upper bound estimation over the distribution of possible conjugate potentials and makes the learning stable, completely eliminating the need for additional extensive fine-tuning. Proposed method, called Expectile-Regularised Neural Optimal Transport (ENOT), outperforms previous state-of-the-art approaches on the established Wasserstein-2 benchmark tasks by a large margin (up to a 3-fold improvement in quality and up to a 10-fold improvement in runtime). Moreover, we showcase performance of ENOT for varying cost functions on different tasks such as image generation, showing robustness of proposed algorithm. OTT-JAX library includes our implementation of ENOT algorithm https://ott-jax.readthedocs.io/en/latest/tutorials/ENOT.html
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 97b5ebea-2454-452a-a1d5-e91abb2aac39Cited by top-tier papers4
- 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
- HOTA: Hamiltonian framework for Optimal Transport AdvectionNazar Buzun, Daniil Shlenskii, Maksim Bobrin, Dmitry V. DylovICLR 2026 · 2 citations
- Hierarchical Refinement: Optimal Transport to Infinity and BeyondPeter Halmos, Julian Gold, Xinhao Liu, Benjamin J. RaphaelICML 2025
- Quadratically Regularized Optimal Transport: Localization Bounds and Affine Case AnalysisLong Nguyen-Chi, Nam Nguyen, Binh T. NguyenICML 2026
Builds on15
- Optimal transport mapping via input convex neural networksAshok Vardhan Makkuva, Amirhossein Taghvaei, Sewoong Oh, Jason D. LeeICML 2020 · 254 citations
- Neural Optimal TransportAlexander Korotin, Daniil Selikhanovych, Evgeny BurnaevICLR 2023 · 151 citations
- Wasserstein-2 Generative NetworksAlexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin et al.ICLR 2021 · 128 citations
- Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 BenchmarkAlexander Korotin, Lingxiao Li, Aude Genevay, Justin M. Solomon et al.NeurIPS 2021 · 124 citations
- Wasserstein GAN With Quadratic Transport CostHuidong Liu, Xianfeng Gu, Dimitris SamarasICCV 2019 · 104 citations
Related papers
- Entropic Neural Optimal Transport via Diffusion ProcessesNikita Gushchin, Alexander Kolesov, Alexander Korotin, Dmitry P. Vetrov et al.NeurIPS 2023 · 59 citations
- Kernel Neural Optimal TransportAlexander Korotin, Daniil Selikhanovych, Evgeny BurnaevICLR 2023 · 10 citations
- Variational Entropic Optimal TransportRoman Dyachenko, Nikita Gushchin, Kirill Sokolov, Petr Mokrov et al.ICML 2026 · 1 citation
- Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport PlanJaemoo Choi, Jaewoong Choi, Dohyun KwonICML 2025
- DCNOT: Diffusion-Cascaded Neural Optimal Transport for Scalable Multi-Domain Image-to-Image TranslationYingzhen Zhang, Jimin Dai, Qianliang Wu, Jian Yang et al.ACM MM 2025 · 1 citation
