Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets #43

Open
nagataka opened this issue Dec 13, 2021 · 0 comments

Comments

@nagataka
Copy link
Owner

Summary

Link

Author/Institution

Xi Chen, Yan Duan, Rein Houthooft, John Schulman, Ilya Sutskever, Pieter Abbeel
UC Berkeley, OpenAI

What is this

  • Present a simple modification to the generative adversarial network objective that encourages it to learn interpretable and meaningful representations.
    • Maximizing the mutual information between fixed small subset of the GAN's noise variables and the observations

Comparison with previous researches. What are the novelties/good points?

  • No supervision of any kind

Key points

z in the GAN. In this paper, they decompose the input noise vector into two parts:

  1. z, which is treated as source of incompressible noise
  2. c, which we will call the latent code and will target the salient structured semantic features of the data distribution

GAN's minimax game formalization
スクリーンショット 2021-12-12 18 20 37

InfoGAN's formulation where I is a mutual information
スクリーンショット 2021-12-12 18 20 46

How the author proved effectiveness of the proposal?

  • Experiments on MNIST, CelebA, and SVHN
  • Two goals
    • If mutual information can be maximized efficiently
    • To evaluate if InfoGAN can learn disentangled and interpretable representations
      • Confirmed by making use of the generator to vary only one latent factor at a time in order to assess if varying such factor results in only one type of semantic variation in generated iamges

Any discussions?

What should I read next?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant