Support matching: A novel regularization to escape from mode collapse in GANs

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Generative adversarial network (GAN) is an implicit generative model known for its ability to generate sharp images. However, it is poor at generating diverse data, which refers to the mode collapse problem. It turns out that GAN is prone to emphasizing the quality of samples but ignoring their diversity. When mode collapse happens, the support of the generated data distribution is not aligned with that of the real data distribution. We thus propose Support Regularized-GAN (SR-GAN) to address such a mode collapse issue by matching their support. Our experiments on synthetic and real-world datasets show that our regularization can mitigate the mode collapse and also improve the data quality.

Author supplied keywords

Cite

CITATION STYLE

APA

Yao, Y., Pan, Y., Tsang, I. W., & Yao, X. (2019). Support matching: A novel regularization to escape from mode collapse in GANs. In Communications in Computer and Information Science (Vol. 1142 CCIS, pp. 40–48). Springer. https://doi.org/10.1007/978-3-030-36808-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free