ResearchTrend.AI
Wasserstein GANs with Gradient Penalty Compute Congested Transport
v1v2 (latest)

Wasserstein GANs with Gradient Penalty Compute Congested Transport

Annual Conference Computational Learning Theory (COLT), 2021
Tristan Milne
A. Nachman
    OT
ArXiv (abs)PDFHTML

Papers citing "Wasserstein GANs with Gradient Penalty Compute Congested Transport"

4 / 4 papers shown
Title
High Accuracy and Cost-Saving Active Learning 3D WD-UNet for Airway Segmentation
High Accuracy and Cost-Saving Active Learning 3D WD-UNet for Airway SegmentationSymposium on Medical Information Processing and Analysis (MIPA), 2023
Shiyi Wang
Yang Nan
Simon Walsh
Guang Yang
MedIm
91
1
0
09 Oct 2023
A new method for determining Wasserstein 1 optimal transport maps from Kantorovich potentials, with deep learning applications
A new method for determining Wasserstein 1 optimal transport maps from Kantorovich potentials, with deep learning applications
Tristan Milne
Étienne Bilocq
A. Nachman
OT
104
3
0
02 Nov 2022
Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?
Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?Neural Information Processing Systems (NeurIPS), 2022
Alexander Korotin
Alexander Kolesov
Evgeny Burnaev
OT
162
28
0
15 Jun 2022
Generative Adversarial Neural Operators
Generative Adversarial Neural Operators
Md Ashiqur Rahman
Manuel A. Florez
Anima Anandkumar
Zachary E. Ross
Kamyar Azizzadenesheli
GAN
213
50
0
06 May 2022

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.