mlsanityData to 14 Oct 2026

ENOT: Expectile Regularization for Fast and Accurate Training of Neural Optimal Transport

arXiv 2403.03777 ↗First posted 6 Mar 2024cs.LG cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

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

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 35 of its 57 references that are in the map. First posted on arXiv 6 Mar 2024.

Builds on

35 of 57 references.

References · 35

  1. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
  2. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
  3. 2014Deep Learning Face Attributes in the Wildcited by 3,693
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  5. 2017Improved Training of Wasserstein GANscited by 2,235
  6. 2019StarGAN v2: Diverse Image Synthesis for Multiple Domainscited by 1,098
  7. 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,070
  8. 2016Input Convex Neural Networkscited by 414
  9. 2019Optimal transport mapping via input convex neural networkscited by 206
  10. 2022Neural Optimal Transportcited by 126
  11. 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 101
  12. 2019Wasserstein-2 Generative Networkscited by 97
23 more
  1. 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 96
  2. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
  3. 2021Generative Modeling with Optimal Transport Mapscited by 82
  4. 2023Reinforcement Learning from Passive Data via Latent Intentionscited by 68
  5. 2022Watch and Match: Supercharging Imitation with Regularized Optimal Transportcited by 67
  6. 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
  7. 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 50
  8. 2021Cross-Domain Imitation Learning via Optimal Transportcited by 49
  9. 2023Optimal Transport for Offline Imitation Learningcited by 42
  10. 20192-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANscited by 33
  11. 2023The Monge Gap: A Regularizer to Learn All Transport Mapscited by 32
  12. 2022Kernel Neural Optimal Transportcited by 31
  13. 2022On amortizing convex conjugates for optimal transportcited by 31
  14. 2020Imitation Learning with Sinkhorn Distancescited by 30
  15. 2019On Scalable and Efficient Computation of Large Scale Optimal Transportcited by 29
  16. 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Surveycited by 27
  17. 2019A gradual, semi-discrete approach to generative network training via explicit Wasserstein minimizationcited by 13
  18. 2019Adversarial Computation of Optimal Transport Mapscited by 12
  19. 2023Extremal Domain Translation with Neural Optimal Transportcited by 12
  20. 2019(q,p)-Wasserstein GANs: Comparing Ground Metrics for Wasserstein GANscited by 10
  21. 2020BRUL`E: Barycenter-Regularized Unsupervised Landmark Extractioncited by 5
  22. 2021Landmarks Augmentation with Manifold-Barycentric Oversamplingcited by 4
  23. 2020Unsupervised non-parametric change point detection in quasi-periodic signalscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 4; 2026: 2.

6 papers.