Training Generative Adversarial Networks Via Turing Test
arXiv:1810.10948
Abstract
In this article, we introduce a new mode for training Generative Adversarial Networks (GANs). Rather than minimizing the distance of evidence distribution and the generative distribution , we minimize the distance of and . This adversarial pattern can be interpreted as a Turing test in GANs. It allows us to use information of real samples during training generator and accelerates the whole training procedure. We even find that just proportionally increasing the size of discriminator and generator, it succeeds on 256x256 resolution without adjusting hyperparameters carefully.
arXiv commentfix some clerical errors, add some experimental data
References in corpus (11)
- Adam: A Method for Stochastic Optimization
- Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks
- GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium
- Large Scale GAN Training for High Fidelity Natural Image Synthesis
- Spectral Normalization for Generative Adversarial Networks
- Progressive Growing of GANs for Improved Quality, Stability, and Variation
- Improved Training of Wasserstein GANs
- f-GAN: Training Generative Neural Samplers using Variational Divergence Minimization
- The relativistic discriminator: a key element missing from standard GAN
- The Cramer Distance as a Solution to Biased Wasserstein Gradients
- Variational Discriminator Bottleneck: Improving Imitation Learning, Inverse RL, and GANs by Constraining Information Flow