Optimizing the Latent Space of Generative Networks

By Piotr Bojanowski, Armand Joulin, David Lopez-Paz, Arthur Szlam. 2017

462 citations recorded by the source corpus.

Generative Adversarial Networks (GANs) have achieved remarkable results in the task of generating realistic natural images. In most successful applications, GAN models share two common aspects: solving a challenging saddle point optimization problem, interpreted as an adversarial game between a generator and a discriminator functions; and parameterizing the generator and the discriminator as deep convolutional neural networks. The goal of this paper is to disentangle the contribution of these two factors to the success of GANs. In particular, we introduce Generative Latent Optimization (GLO), a framework to train deep convolutional generators using simple reconstruction losses. Throughout a variety of experiments, we show that GLO enjoys many of the desirable properties of GANs: synthesizing visually-appealing samples, interpolating meaningfully between samples, and performing linear arithmetic with noise vectors; all of this without the adversarial optimization scheme.

Subfields: Computer Vision and Pattern Recognition, Generative Models, Representation & Self-Supervised Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Ming-Hsuan Yang
  3. Dacheng Tao
  4. Andrea Vedaldi
  5. Jitendra Malik
  6. Xiaogang Wang
  7. Trevor Darrell
  8. Andrew Zisserman

In Generative Models

  1. Ying Nian Wu
  2. Song-Chun Zhu
  3. Eli Shechtman
  4. Erik Nijkamp
  5. Bolei Zhou
  6. Bernhard Schölkopf
  7. Arash Vahdat
  8. Jun-Yan Zhu

In Representation & Self-Supervised Learning

  1. Andrea Vedaldi
  2. Armand Joulin
  3. Ishan Misra
  4. Piotr Bojanowski
  5. Mathilde Caron
  6. Andrew Zisserman
  7. Song-Chun Zhu
  8. Yoshua Bengio

Citations in the corpus