On Convergence and Stability of GANs

Naveen Kodali, James Hays, Jacob Abernethy, Zsolt Kira

Feb 15, 2018 (modified: Oct 27, 2017) ICLR 2018 Conference Blind Submission readers: everyone Show Bibtex
  • Abstract: We propose studying GAN training dynamics as regret minimization, which is in contrast to the popular view that there is consistent minimization of a divergence between real and generated distributions. We analyze the convergence of GAN training from this new point of view to understand why mode collapse happens. We hypothesize the existence of undesirable local equilibria in this non-convex game to be responsible for mode collapse. We observe that these local equilibria often exhibit sharp gradients of the discriminator function around some real data points. We demonstrate that these degenerate local equilibria can be avoided with a gradient penalty scheme called DRAGAN. We show that DRAGAN enables faster training, achieves improved stability with fewer mode collapses, and leads to generator networks with better modeling performance across a variety of architectures and objective functions.
  • TL;DR: Analysis of convergence and mode collapse by studying GAN training process as regret minimization
  • Keywords: GAN, Generative Adversarial Networks, Mode Collapse, Stability, Game Theory, Regret Minimization, Convergence, Gradient Penalty
0 Replies