Name
Abstract | ||
|---|---|---|
Recent work by Brock et al. (2018) suggests that Generative Adversarial Networks (GANs) benefit disproportionately from large mini-batch sizes. Unfortunately, using large batches is slow and expensive on conventional hardware. Thus, it would be nice if we could generate batches that were effectively large though actually small. In this work, we propose a method to do this, inspired by the use of Coreset-selection in active learning. When training a GAN, we draw a large batch of samples from the prior and then compress that batch using Coreset-selection. To create effectively large batches of 'real' images, we create a cached dataset of Inception activations of each training image, randomly project them down to a smaller dimension, and then use Coreset-selection on those projected activations at training time. We conduct experiments showing that this technique substantially reduces training time and memory usage for modern GAN variants, that it reduces the fraction of dropped modes in a synthetic dataset, and that it allows GANs to reach a new state of the art in anomaly detection. |
Year | Venue | DocType |
|---|---|---|
2020 | ICML | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samarth Sinha | 1 | 24 | 4.01 |
| Han Zhang | 2 | 243 | 15.29 |
| Anirudh Goyal | 3 | 264 | 20.97 |
| Yoshua Bengio | 4 | 42677 | 3039.83 |
| Hugo Larochelle | 5 | 7692 | 488.99 |
| Augustus Odena | 6 | 338 | 16.45 |