Research map / Learning theory and algorithms / Optimal transport
Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On the Convergence and Robustness of Training GANs with Regularized Optimal Transport (NeurIPS 2018 · similarity 0.91)
- Generative Modeling with Optimal Transport Maps (ICLR 2022 · similarity 0.90)
- Towards Generalized Implementation of Wasserstein Distance in GANs (AAAI 2021 · similarity 0.90)
- Parallel Optimal Transport GAN (CVPR 2019 · similarity 0.89)
- Analyzing and Improving Optimal-Transport-based Adversarial Networks (ICLR 2024 · similarity 0.88)
- Scalable Wasserstein Gradient Flow for Generative Modeling through Unbalanced Optimal Transport (ICML 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.