Boundary-Seeking Generative Adversarial Networks

R. Devon Hjelm,Athul Paul Jacob,Tong Che,Kyunghyun Cho,Yoshua Bengio

Published 2017 in International Conference on Learning Representations

ABSTRACT

Generative adversarial networks (GANs) are a learning framework that rely on training a discriminator to estimate a measure of difference between a target and generated distributions. GANs, as normally formulated, rely on the generated samples being completely differentiable w.r.t. the generative parameters, and thus do not work for discrete data. We introduce a method for training GANs with discrete data that uses the estimated difference measure from the discriminator to compute importance weights for generated samples, thus providing a policy gradient for training the generator. The importance weights have a strong connection to the decision boundary of the discriminator, and we call our method boundary-seeking GANs (BGANs). We demonstrate the effectiveness of the proposed algorithm with discrete image and character-based natural language generation. In addition, the boundary-seeking objective extends to continuous data, which can be used to improve stability of training.

PUBLICATION RECORD

  • Publication year

    2017

  • Venue

    International Conference on Learning Representations

  • Publication date

    2017-02-27

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-59 of 59 references · Page 1 of 1

CITED BY

Showing 1-100 of 176 citing papers · Page 1 of 2