mlsanityData to 7 Oct 2026

Light Unbalanced Optimal Transport

arXiv 2303.07988 ↗First posted 14 Mar 2023cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

While the continuous Entropic Optimal Transport (EOT) field has been actively developing in recent years, it became evident that the classic EOT problem is prone to different issues like the sensitivity to outliers and imbalance of classes in the source and target measures. This fact inspired the development of solvers that deal with the unbalanced EOT (UEOT) problem - the generalization of EOT allowing for mitigating the mentioned issues by relaxing the marginal constraints. Surprisingly, it turns out that the existing solvers are either based on heuristic principles or heavy-weighted with complex optimization objectives involving several neural networks. We address this challenge and propose a novel theoretically-justified, lightweight, unbalanced EOT solver. Our advancement consists of developing a novel view on the optimization of the UEOT problem yielding tractable and a non-minimax optimization objective. We show that combined with a light parametrization recently proposed in the field our objective leads to a fast, simple, and effective solver which allows solving the continuous UEOT problem in minutes on CPU. We prove that our solver provides a universal approximation of UEOT solutions and obtain its generalization bounds. We give illustrative examples of the solver's performance. The code is publicly available at https://github.com/milenagazdieva/LightUnbalancedOptimalTransport.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 47 of its 68 references that are in the map. First posted on arXiv 14 Mar 2023.

Builds on

47 of 68 references.

References · 47

  1. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  2. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
  3. 2022Flow Matching for Generative Modelingcited by 5,426
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  5. 2017Improved Training of Wasserstein GANscited by 2,223
  6. 2018Computational Optimal Transportcited by 765
  7. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  8. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  9. 2017Toward Multimodal Image-to-Image Translationcited by 295
  10. 2017Are GANs Created Equal? A Large-Scale Studycited by 267
  11. 2021Likelihood Training of Schr"odinger Bridge using Forward-Backward SDEs Theorycited by 216
  12. 2019Optimal transport mapping via input convex neural networkscited by 202
35 more
  1. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
  2. 2020Adversarial Latent Autoencoderscited by 155
  3. 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
  4. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
  5. 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
  6. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
  7. 2021Deep Generative Learning via Schr"odinger Bridgecited by 103
  8. 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
  9. 2021Entropic estimation of optimal transport mapscited by 87
  10. 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
  11. 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 83
  12. 2021Generative Modeling with Optimal Transport Mapscited by 80
  13. 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
  14. 2020On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithmcited by 61
  15. 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 59
  16. 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 52
  17. 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 50
  18. 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 49
  19. 2022Entropic Neural Optimal Transport via Diffusion Processescited by 49
  20. 2022Unbalanced Optimal Transport, from Theory to Numericscited by 45
  21. 2018Scalable Unbalanced Optimal Transport using Generative Adversarial Networkscited by 41
  22. 2021Neural Monge Map estimation and its applicationscited by 40
  23. 2022Neural Optimal Transport with General Cost Functionalscited by 34
  24. 20192-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANscited by 32
  25. 2021Unbalanced Optimal Transport through Non-negative Penalized Linear Regressioncited by 31
  26. 2022Kernel Neural Optimal Transportcited by 31
  27. 2019On Scalable and Efficient Computation of Large Scale Optimal Transportcited by 29
  28. 2020Optimal Bounds between f-Divergences and Integral Probability Metricscited by 27
  29. 2018Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenterscited by 21
  30. 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?cited by 19
  31. 2022On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Errorcited by 16
  32. 2022Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplingscited by 16
  33. 2022An Optimal Transport Perspective on Unpaired Image Super-Resolutioncited by 12
  34. 2023Extremal Domain Translation with Neural Optimal Transportcited by 12
  35. 2022An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenterscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 5.

8 papers.