Optimal Transport driven CycleGAN for Unsupervised Learning in Inverse Problems

To improve the performance of classical generative adversarial network (GAN), Wasserstein generative adversarial networks (W-GAN) was developed as a Kantorovich dual formulation of the optimal transport (OT) problem using Wasserstein-1 distance. However, it was not clear how cycleGAN-type generative models can be derived from the optimal transport theory... (read more)

Results in Papers With Code
(↓ scroll down to see all results)