Generalization and Stability of GANs: A theory and promise from data augmentation

Khoat Than, Nghia Vu

Keywords: generative adversarial networks, generalization, stability, data augmentation

Abstract: The instability when training generative adversarial networks (GANs) is a notoriously difficult issue, and the generalization of GANs remains open. In this paper, we will analyze various sources of instability which not only come from the discriminator but also the generator. We then point out that the requirement of Lipschitz continuity on both the discriminator and generator leads to generalization and stability for GANs. As a consequence, this work naturally provides a generalization bound for a large class of existing models and explains the success of recent large-scale generators. Finally, we show why data augmentation can ensure Lipschitz continuity on both the discriminator and generator. This work therefore provides a theoretical basis for a simple way to ensure generalization in GANs, explaining the highly successful use of data augmentation for GANs in practice.

One-sentence Summary: This paper provides generalization bounds under Lipschitz continuity assumption, analyzes various sources of instability, and shows why data augmentation can ensure Lipschitz continuity on both the discriminator and generator.

Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics

Reviewed Version (pdf): https://openreview.net/references/pdf?id=kY51C-HWDU