Dual Discriminator Generative Adversarial Nets
Tu Dinh Nguyen, Trung Le, Hung Vu, Dinh Phung

TL;DR
This paper introduces D2GAN, a novel GAN variant with dual discriminators that combines KL and reverse KL divergences to effectively address mode collapse and improve diversity in generated samples.
Contribution
The paper proposes D2GAN, a new GAN architecture with two discriminators that jointly optimize to reduce mode collapse and enhance sample diversity, supported by theoretical analysis.
Findings
D2GAN effectively reduces mode collapse.
D2GAN generates diverse, high-quality samples.
D2GAN scales to large datasets like ImageNet.
Abstract
We propose in this paper a novel approach to tackle the problem of mode collapse encountered in generative adversarial network (GAN). Our idea is intuitive but proven to be very effective, especially in addressing some key limitations of GAN. In essence, it combines the Kullback-Leibler (KL) and reverse KL divergences into a unified objective function, thus it exploits the complementary statistical properties from these divergences to effectively diversify the estimated density in capturing multi-modes. We term our method dual discriminator generative adversarial nets (D2GAN) which, unlike GAN, has two discriminators; and together with a generator, it also has the analogy of a minimax game, wherein a discriminator rewards high scores for samples from data distribution whilst another discriminator, conversely, favoring data from the generator, and the generator produces data to fool both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Advanced Image Processing Techniques · Image Enhancement Techniques
MethodsConvolution · Dogecoin Customer Service Number +1-833-534-1729
