Comparison of Maximum Likelihood and GAN-based training of Real NVPs

Ivo Danihelka , Balaji Lakshminarayanan , Benigno Uria , Daan Wierstra , Peter Dayan

Authors on Pith no claims yet

classification 💻 cs.LG

keywords generatorwassersteinapproximatecriticlearninglikelihoodmaximumtrain

read the original abstract

We train a generator by maximum likelihood and we also train the same generator architecture by Wasserstein GAN. We then compare the generated samples, exact log-probability densities and approximate Wasserstein distances. We show that an independent critic trained to approximate Wasserstein distance between the validation set and the generator distribution helps detect overfitting. Finally, we use ideas from the one-shot learning literature to develop a novel fast learning critic.

This paper has not been read by Pith yet.

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Demystifying MMD GANs
stat.ML 2018-01 accept novelty 6.0

MMD GANs have unbiased critic gradients but biased generator gradients from sample-based learning, and the Kernel Inception Distance provides a practical new measure for GAN convergence and dynamic learning rate adaptation.