On the Convergence and Robustness of Training GANs with Regularized Optimal Transport

Understand

Generative Adversarial Networks (GANs) are one of the most practical methods for learning data distributions.

• A popular GAN formulation is based on the use of Wasserstein distance as a metric between probability distributions.
• Unfortunately, minimizing the Wasserstein distance between the data distribution and the generative model distribution is a computationally challenging problem as its objective is non-convex, non-smooth, and even hard to compute.
• In this work, we show that obtaining gradient information of the smoothed Wasserstein GAN formulation, which is based on regularized Optimal Transport (OT), is computationally effortless and hence one can apply first order optimization methods to minimize this objective.