Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.04051 v1 pith:Z7ZO6X6N submitted 2016-11-12 stat.ML cs.LG

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

classification stat.ML cs.LG
keywords distributiondiscreteelementsgumbel-softmaxsequencesgansmultinomialnetworks
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FlexAct: Why Learn when you can Pick?

    cs.LG 2026-01 reject novelty 2.0

    A Gumbel-Softmax router that discretely selects among five fixed activation functions, plus a gradient-norm regularizer, recovers the generating activation on toy regression tasks but never beats the matching fixed ac...