Local Stability and Performance of Simple Gradient Penalty mu-Wasserstein GAN

10/05/2018
by   Cheolhyeong Kim, et al.
4

Wasserstein GAN(WGAN) is a model that minimizes the Wasserstein distance between a data distribution and sample distribution. Recent studies have proposed stabilizing the training process for the WGAN and implementing the Lipschitz constraint. In this study, we prove the local stability of optimizing the simple gradient penalty μ-WGAN(SGP μ-WGAN) under suitable assumptions regarding the equilibrium and penalty measure μ. The measure valued differentiation concept is employed to deal with the derivative of the penalty terms, which is helpful for handling abstract singular measures with lower dimensional support. Based on this analysis, we claim that penalizing the data manifold or sample manifold is the key to regularizing the original WGAN with a gradient penalty. Experimental results obtained with unintuitive penalty measures that satisfy our assumptions are also provided to support our theoretical results.

READ FULL TEXT

page 8

page 9

page 19

page 20

page 21

research
03/16/2018

Varying k-Lipschitz Constraint for Generative Adversarial Networks

Generative Adversarial Networks (GANs) are powerful generative models, b...
research
01/13/2018

On the convergence properties of GAN training

Recent work has shown local convergence of GAN training for absolutely c...
research
07/24/2019

Sparse Optimization on Measures with Over-parameterized Gradient Descent

Minimizing a convex function of a measure with a sparsity-inducing penal...
research
07/02/2018

Understanding the Effectiveness of Lipschitz Constraint in Training of GANs via Gradient Analysis

This paper aims to bring a new perspective for understanding GANs, by de...
research
10/15/2019

Connections between Support Vector Machines, Wasserstein distance and gradient-penalty GANs

We generalize the concept of maximum-margin classifiers (MMCs) to arbitr...
research
09/01/2021

Wasserstein GANs with Gradient Penalty Compute Congested Transport

Wasserstein GANs with Gradient Penalty (WGAN-GP) are an extremely popula...
research
01/22/2019

Minimal penalties and the slope heuristics: a survey

Birgé and Massart proposed in 2001 the slope heuristics as a way to choo...

Please sign up or login with your details

Forgot password? Click here to reset