RankGAN: A Maximum Margin Ranking GAN for Generating Faces

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

Abstract

We present a new stage-wise learning paradigm for training generative adversarial networks (GANs). The goal of our work is to progressively strengthen the discriminator and thus, the generators, with each subsequent stage without changing the network architecture. We call this proposed method the RankGAN. We first propose a margin-based loss for the GAN discriminator. We then extend it to a margin-based ranking loss to train the multiple stages of RankGAN. We focus on face images from the CelebA dataset in our work and show visual as well as quantitative improvements in face generation and completion tasks over other GAN approaches, including WGAN and LSGAN.

Cite

CITATION STYLE

APA

Juefei-Xu, F., Dey, R., Boddeti, V. N., & Savvides, M. (2019). RankGAN: A Maximum Margin Ranking GAN for Generating Faces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11363 LNCS, pp. 3–18). Springer Verlag. https://doi.org/10.1007/978-3-030-20893-6_1

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