GAN and VAE from an Optimal Transport Point of View
Not on the map. Why?
Abstract (arXiv)
This short article revisits some of the ideas introduced in arXiv:1701.07875 and arXiv:1705.07642 in a simple setup. This sheds some lights on the connexions between Variational Autoencoders (VAE), Generative Adversarial Networks (GAN) and Minimum Kantorovitch Estimators (MKE).
Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 5; 2023: 7; 2024: 2; 2025: 0; 2026: 1.
19 papers.
Sort:
- 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
- 2023A mean-field games laboratory for generative modelingcited by 28
- 2022Wasserstein Iterative Networks for Barycenter Estimationcited by 23
- 2021Regularising Inverse Problems with Generative Machine Learning Modelscited by 22
- 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?cited by 19
- 2022Sliced Optimal Partial Transportcited by 19
- 2022A survey on GANs for computer vision: Recent research, analysis and taxonomycited by 15
- 2024Accelerating Sinkhorn Algorithm with Sparse Newton Iterationscited by 9
- 2023Linear Optimal Partial Transport Embeddingcited by 8
- 2023One-Line-of-Code Data Mollification Improves Optimization of Likelihood-based Generative Modelscited by 4
- 2023Differentially Private Gradient Flow based on the Sliced Wasserstein Distancecited by 4
- 2021Bi-Discriminator Class-Conditional Tabular GANcited by 3
7 more
- 2022Challenges in creative generative models for music: a divergence maximization perspectivecited by 3
- 2024A Sinkhorn-type Algorithm for Constrained Optimal Transportcited by 3
- 2021Model Uncertainty and Correctability for Directed Graphical Modelscited by 2
- 2021Robustness-via-Synthesis: Robust Training with Generative Adversarial Perturbationscited by 1
- 2023Leveraging Optimal Transport via Projections on Subspaces for Machine Learning Applicationscited by 1
- 2023On Certified Generalization in Structured Predictioncited by 0
- 2026Unfolding with a Wasserstein Losscited by 0
- 2026Unfolding with a Wasserstein Loss21 Mar 2026
- 2024A Sinkhorn-type Algorithm for Constrained Optimal Transport8 Mar 2024
- 2024Accelerating Sinkhorn Algorithm with Sparse Newton Iterations20 Jan 2024
- 2023Differentially Private Gradient Flow based on the Sliced Wasserstein Distance13 Dec 2023
- 2023Leveraging Optimal Transport via Projections on Subspaces for Machine Learning Applications23 Nov 2023
- 2023Recent Advances in Optimal Transport for Machine Learning28 Jun 2023
- 2023On Certified Generalization in Structured Prediction15 Jun 2023
- 2023One-Line-of-Code Data Mollification Improves Optimization of Likelihood-based Generative Models30 May 2023
- 2023A mean-field games laboratory for generative modeling26 Apr 2023
- 2023Linear Optimal Partial Transport Embedding7 Feb 2023
- 2022Sliced Optimal Partial Transport15 Dec 2022
- 2022Challenges in creative generative models for music: a divergence maximization perspective16 Nov 2022
7 more
- 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?15 Jun 2022
- 2022A survey on GANs for computer vision: Recent research, analysis and taxonomy21 Mar 2022
- 2022Wasserstein Iterative Networks for Barycenter Estimation28 Jan 2022
- 2021Bi-Discriminator Class-Conditional Tabular GAN12 Nov 2021
- 2021Robustness-via-Synthesis: Robust Training with Generative Adversarial Perturbations22 Aug 2021
- 2021Regularising Inverse Problems with Generative Machine Learning Models22 Jul 2021
- 2021Model Uncertainty and Correctability for Directed Graphical Models17 Jul 2021
- 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
- 2023A mean-field games laboratory for generative modelingcited by 28
- 2022Wasserstein Iterative Networks for Barycenter Estimationcited by 23
- 2021Regularising Inverse Problems with Generative Machine Learning Modelscited by 22
- 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?cited by 19
- 2022Sliced Optimal Partial Transportcited by 19
- 2022A survey on GANs for computer vision: Recent research, analysis and taxonomycited by 15
- 2024Accelerating Sinkhorn Algorithm with Sparse Newton Iterationscited by 9
- 2023Linear Optimal Partial Transport Embeddingcited by 8
- 2023One-Line-of-Code Data Mollification Improves Optimization of Likelihood-based Generative Modelscited by 4
- 2023Differentially Private Gradient Flow based on the Sliced Wasserstein Distancecited by 4
- 2021Bi-Discriminator Class-Conditional Tabular GANcited by 3
12 most cited of 19 All 19 (JSON)
- 2026Unfolding with a Wasserstein Loss21 Mar 2026
- 2024A Sinkhorn-type Algorithm for Constrained Optimal Transport8 Mar 2024
- 2024Accelerating Sinkhorn Algorithm with Sparse Newton Iterations20 Jan 2024
- 2023Differentially Private Gradient Flow based on the Sliced Wasserstein Distance13 Dec 2023
- 2023Leveraging Optimal Transport via Projections on Subspaces for Machine Learning Applications23 Nov 2023
- 2023Recent Advances in Optimal Transport for Machine Learning28 Jun 2023
- 2023On Certified Generalization in Structured Prediction15 Jun 2023
- 2023One-Line-of-Code Data Mollification Improves Optimization of Likelihood-based Generative Models30 May 2023
- 2023A mean-field games laboratory for generative modeling26 Apr 2023
- 2023Linear Optimal Partial Transport Embedding7 Feb 2023
- 2022Sliced Optimal Partial Transport15 Dec 2022
- 2022Challenges in creative generative models for music: a divergence maximization perspective16 Nov 2022
12 newest of 19 All 19 (JSON)