Abstract
Wasserstein generative adversarial networks (Wasserstein GANs, WGAN) improve the performance of GANs significantly by imposing the Lipschitz constraints on the critic, which is implemented by weight clipping. In this work, we argue that weight clipping could result in a side effect called area collapse by modifying orientations of weights heavily. To fix this issue, a novel method called Lp-WGAN is presented, where lp-norm normalization is employed to impose the constraints. This method restricts the searching space of weights within a low-dimensional manifold and focuses on searching orientations of weights. Experiments on toy datasets show that Lp-WGAN could spread probability mass and find the underlying distribution earlier than WGAN with weight clipping. Results on the LSUN bedroom dataset and CIFAR-10 dataset show that the proposed method could stabilize training better, generate competitive images earlier and get higher evaluation scores.
| Original language | English |
|---|---|
| Pages (from-to) | 415-424 |
| Number of pages | 10 |
| Journal | Knowledge-Based Systems |
| Volume | 161 |
| DOIs | |
| State | Published - 1 Dec 2018 |
Keywords
- Deep learning
- Generative adversarial networks
- Lipschitz constraints
- Normalization
Fingerprint
Dive into the research topics of 'Lp-WGAN: Using Lp-norm normalization to stabilize Wasserstein generative adversarial networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver