Bridging the Gap Between Coulomb GAN and Gradient-regularized WGAN

Siddarth Asokan, Chandra Sekhar Seelamantula

Keywords: Coulomb GAN, Gradient-regularized WGAN, Calculus of Variations, Poisson partial differential equation, Radial basis functions

TL;DR: We analyze the optimization problem in Coulomb GAN through variational calculus. The optimal Coulomb GAN discriminator arises naturally as the Green's function of the Poisson PDE that governs the solutions to gradient-regularized Wasserstein GANs.

Abstract: Generative adversarial networks (GANs) are essentially a min-max game between the discriminator and a generator. Coulomb GANs have a closely related formulation where the generator minimizes the potential difference between real (negative) and fake (positive) charge densities, wherein the discriminator approximates a low-dimensional Plummer kernel centered around the samples. Motivated by links between electrostatic potential theory and the Poisson partial differential equation (PDE), we consider the underlying functional optimization in Coulomb GAN and show that the associated discriminator is the optimum of a first-order gradient-regularized Wasserstein GAN (WGAN) cost. Subsequently, we show that, within the regularized WGAN setting, the optimal discriminator is the Green's function to the Poisson PDE, which corresponds to the Coulomb potential. As an alternative to training a discriminator in either WGAN or Coulomb GAN, we demonstrate, by means of synthetic data experiments, that the closed-form implementation of the optimal discriminator leads to a superior performance of the GAN generator.