mlsanityData to 7 Oct 2026

Dropout-GAN: Learning from a Dynamic Ensemble of Discriminators

arXiv 1807.11346 ↗First posted 30 Jul 2018cs.LG stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

We propose to incorporate adversarial dropout in generative multi-adversarial networks, by omitting or dropping out, the feedback of each discriminator in the framework with some probability at the end of each batch. Our approach forces the single generator not to constrain its output to satisfy a single discriminator, but, instead, to satisfy a dynamic ensemble of discriminators. We show that this leads to a more generalized generator, promoting variety in the generated samples and avoiding the common mode collapse problem commonly experienced with generative adversarial networks (GANs). We further provide evidence that the proposed framework, named Dropout-GAN, promotes sample diversity both within and across epochs, eliminating mode collapse and stabilizing training.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jul 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 2; 2023: 2; 2024: 2; 2025: 4.

15 papers.

Sort:

By area: