PacGAN: The power of two samples in generative adversarial networks, NeurIPS 2018
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
celeba_experiments
stacked_MNIST_experiments Update README.md Nov 29, 2018
synthetic_data_experiments Update README.md Nov 29, 2018
.gitignore
LICENSE first commit Jan 28, 2018
README.md Update README.md Nov 29, 2018

README.md

PacGAN: The power of two samples in generative adversarial networks

[paper (arXiv)] [paper (NeurIPS)] [poster] [website] [interview (youtube)] [code]

Authors: Zinan Lin, Ashish Khetan, Giulia Fanti, Sewoong Oh

Abstract: Generative adversarial networks (GANs) are innovative techniques for learning generative models of complex data distributions from samples. Despite remarkable recent improvements in generating realistic images, one of their major shortcomings is the fact that in practice, they tend to produce samples with little diversity, even when trained on diverse datasets. This phenomenon, known as mode collapse, has been the main focus of several recent advances in GANs. Yet there is little understanding of why mode collapse happens and why existing approaches are able to mitigate mode collapse. We propose a principled approach to handling mode collapse, which we call packing. The main idea is to modify the discriminator to make decisions based on multiple samples from the same class, either real or artificially generated. We borrow analysis tools from binary hypothesis testing---in particular the seminal result of Blackwell [Bla53]---to prove a fundamental connection between packing and mode collapse. We show that packing naturally penalizes generators with mode collapse, thereby favoring generator distributions with less mode collapse during the training process. Numerical experiments on benchmark datasets suggests that packing provides significant improvements in practice as well.

Codes for reproducing results in paper

Prerequisites

The codes are based on GPUTaskScheduler library. Please install it first.

Code list