GANS for Sequences of Discrete Elements with the Gumbel-softmax Distribution

By Matt J. Kusner, José Miguel Hernández-Lobato. 2016

341 citations recorded by the source corpus.

Generative Adversarial Networks (GAN) have limitations when the goal is to generate sequences of discrete elements. The reason for this is that samples from a distribution on discrete objects such as the multinomial are not differentiable with respect to the distribution parameters. This problem can be avoided by using the Gumbel-softmax distribution, which is a continuous approximation to a multinomial distribution parameterized in terms of the softmax function. In this work, we evaluate the performance of GANs based on recurrent neural networks with Gumbel-softmax output distributions in the task of generating sequences of discrete elements.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Generative Models

How researchers see this paper

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

In Artificial Intelligence

  1. Mohit Bansal
  2. Jianfeng Gao
  3. Yoshua Bengio
  4. Percy Liang
  5. Kyunghyun Cho
  6. Ruslan Salakhutdinov
  7. Dacheng Tao
  8. Eric P. Xing

In Computer Vision and Pattern Recognition

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

In Generative Models

  1. Yoshua Bengio
  2. Aaron C. Courville
  3. Sergey I. Nikolenko
  4. Dacheng Tao
  5. Sylvain Gelly
  6. Mario Lucic
  7. Alexander M. Rush
  8. Eric P. Xing

Citations in the corpus