OT-Net: A Reusable Neural Optimal Transport Solver
Not on the map. Why?
Abstract (arXiv)
With the widespread application of optimal transport (OT), its calculation becomes essential, and various algorithms have emerged. However, the existing methods either have low efficiency or cannot represent discontinuous maps. A novel reusable neural OT solver OT-Net is thus presented, which first learns Brenier's height representation via the neural network to obtain its potential, and then gained the OT map by computing the gradient of the potential. The algorithm has two merits, 1) it can easily represent discontinuous maps, which allows it to match any target distribution with discontinuous supports and achieve sharp boundaries. This can well eliminate mode collapse in the generated models. 2) The OT map can be calculated straightly by the proposed algorithm when new target samples are added, which greatly improves the efficiency and reusability of the map. Moreover, the theoretical error bound of the algorithm is analyzed, and we have demonstrated the empirical success of our approach in image generation, color transfer, and domain adaptation.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 43 of its 75 references that are in the map. First posted on arXiv 14 Jun 2023.
Builds on
43 of 75 references.
References · 43
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016Improved Techniques for Training GANscited by 2,970
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2016Least Squares Generative Adversarial Networkscited by 1,001
- 2017Wasserstein GANcited by 639
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
- 2017Are GANs Created Equal? A Large-Scale Studycited by 267
- 2016Adversarially Learned Inferencecited by 216
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
31 more
- 2016Unrolled Generative Adversarial Networkscited by 208
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2017VEEGAN: Reducing Mode Collapse in GANs using Implicit Variational Learningcited by 200
- 2017Optimizing the Latent Space of Generative Networkscited by 157
- 2022Neural Optimal Transportcited by 126
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 123
- 2017BEGAN: Boundary Equilibrium Generative Adversarial Networkscited by 121
- 2018Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithmcited by 112
- 2017PacGAN: The power of two samples in generative adversarial networkscited by 104
- 2021Generative Modeling with Optimal Transport Mapscited by 82
- 2017On the regularization of Wasserstein GANscited by 65
- 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 60
- 2022Unified Optimal Transport Framework for Universal Domain Adaptationcited by 57
- 2016From Facial Expression Recognition to Interpersonal Relation Predictioncited by 53
- 2017Variational Approaches for Auto-Encoding Generative Adversarial Networkscited by 52
- 2018On the Convergence and Robustness of Training GANs with Regularized Optimal Transportcited by 51
- 2017Many Paths to Equilibrium: GANs Do Not Need to Decrease a Divergence At Every Stepcited by 45
- 2018Geometric Understanding of Deep Learningcited by 41
- 2022Neural Optimal Transport with General Cost Functionalscited by 36
- 2017A Geometric View of Optimal Transportation and Generative Modelcited by 31
- 2017Structured Optimal Transportcited by 31
- 2020Optimal Transport for Conditional Domain Matching and Label Shiftcited by 20
- 2018Non-Adversarial Image Synthesis with Generative Latent Nearest Neighborscited by 19
- 2018Dynamical Optimal Transport on Discrete Surfacescited by 17
- 2020Wasserstein-based fairness interpretability framework for machine learning modelscited by 14
- 2019A gradual, semi-discrete approach to generative network training via explicit Wasserstein minimizationcited by 13
- 2016Generative Adversarial Networks as Variational Training of Energy Based Modelscited by 10
- 2021Hierarchical Optimal Transport for Unsupervised Domain Adaptationcited by 10
- 2022InfoOT: Information Maximizing Optimal Transportcited by 9
- 2022Unbalanced CO-Optimal Transportcited by 6
- 2017Bayesian Conditional Generative Adverserial Networkscited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.