Flow-GAN: Combining Maximum Likelihood and Adversarial Learning in Generative Models

Aditya Grover, Manik Dhar, Stefano Ermon
5/24/2017
cs.LGcs.AIcs.NE

Official code: ermongroup/flow-gan (110 stars, MIT, last commit 2018-01-13).

Abstract

Adversarial learning of probabilistic models has recently emerged as a promising alternative to maximum likelihood. Implicit models such as generative adversarial networks (GAN) often generate better samples compared to explicit models trained by maximum likelihood. Yet, GANs sidestep the characterization of an explicit density which makes quantitative evaluations challenging. To bridge this gap, we propose Flow-GANs, a generative adversarial network for which we can perform exact likelihood evaluation, thus supporting both adversarial and maximum likelihood training. When trained adversarially, Flow-GANs generate high-quality samples but attain extremely poor log-likelihood scores, inferior even to a mixture model memorizing the training data; the opposite is true when trained by maximum likelihood. Results on MNIST and CIFAR-10 demonstrate that hybrid training can attain high held-out likelihoods while retaining visual fidelity in the generated samples.

View on arXivView PDF

Code Implementations(1)

MIT

Code for "Flow-GAN: Combining Maximum Likelihood and Adversarial Learning in Generative Models", AAAI 2018.

11032PythonSep 8, 20178 years agoMIT

Similar Papers

Cite this paper

@article{grover2017flowgan,
  title  = {Flow-GAN: Combining Maximum Likelihood and Adversarial Learning in Generative Models},
  author = {Aditya Grover and Manik Dhar and Stefano Ermon},
  year   = {2017},
  eprint = {1705.08868},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1705.08868}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1705.08868.svg)](https://codeofpaper.com/paper/1705.08868)

Discussion