about
Improved Training of Wasserstein GANs (arxiv.org)
2 points by EvgeniyZh on May 22, 2017 | hide | past | pdf | discuss on HN

In plain words: Instead of clipping the judge network's weights to keep training steady, this approach penalizes how sharply its score changes as the input changes. It trains more reliably and makes better samples than the weight-clipping version, across many network designs with almost no tuning.

Abstract

Generative Adversarial Networks (GANs) are powerful generative models, but suffer from training instability. The recently proposed Wasserstein GAN (WGAN) makes progress toward stable training of GANs, but sometimes can still generate only low-quality samples or fail to converge. We find that these problems are often due to the use of weight clipping in WGAN to enforce a Lipschitz constraint on the critic, which can lead to undesired behavior. We propose an alternative to clipping weights: penalize the norm of gradient of the critic with respect to its input. Our proposed method performs better than standard WGAN and enables stable training of a wide variety of GAN architectures with almost no hyperparameter tuning, including 101-layer ResNets and language models over discrete data. We also achieve high quality generations on CIFAR-10 and LSUN bedrooms.

Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, Aaron Courville
arXiv:1704.00028 · cs.LG, stat.ML · submitted Mar 31, 2017 · updated Dec 25, 2017
abstract · pdf · html · NIPS camera-ready

add comment on HN