GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium

Code

• github.com/bioinf-jku/TTUR
  OfficialIn papertf★ 0
• github.com/NVlabs/eg3d
  pytorch★ 3,338
• github.com/nvlabs/long-video-gan
  pytorch★ 321
• github.com/SiskonEmilia/StyleGAN-PyTorch
  pytorch★ 113
• github.com/milmor/diffusion-transformer
  pytorch★ 73
• github.com/rucmlcv/L2M-GAN
  pytorch★ 63
• github.com/iamalexkorotin/Wasserstein2Benchmark
  pytorch★ 47
• github.com/iamalexkorotin/KernelNeuralOptimalTransport
  pytorch★ 34
• github.com/ngushchin/entropicotbenchmark
  pytorch★ 32
• github.com/reyllama/mixdl
  pytorch★ 26

Abstract

Generative Adversarial Networks (GANs) excel at creating realistic images with complex models for which maximum likelihood is infeasible. However, the convergence of GAN training has still not been proved. We propose a two time-scale update rule (TTUR) for training GANs with stochastic gradient descent on arbitrary GAN loss functions. TTUR has an individual learning rate for both the discriminator and the generator. Using the theory of stochastic approximation, we prove that the TTUR converges under mild assumptions to a stationary local Nash equilibrium. The convergence carries over to the popular Adam optimization, for which we prove that it follows the dynamics of a heavy ball with friction and thus prefers flat minima in the objective landscape. For the evaluation of the performance of GANs at image generation, we introduce the "Fr\'echet Inception Distance" (FID) which captures the similarity of generated images to real ones better than the Inception Score. In experiments, TTUR improves learning for DCGANs and Improved Wasserstein GANs (WGAN-GP) outperforming conventional GAN training on CelebA, CIFAR-10, SVHN, LSUN Bedrooms, and the One Billion Word Benchmark.

Tasks

Benchmark Results

Reproductions