korrents

korrents · papers

Generative Adversarial Networks (with 7 co-authors)

Yoshua Bengio · 10 Jun 2014 · arxiv.org

2 korrents from this paper

In plain words

Two networks play a game where one creates fake samples to fool the other into thinking they are real data, until the creator matches the true data distribution. It lets generative models train with simple backpropagation without Markov chains or hard probability steps, and experiments show competitive samples on image sets. It proposes this adversarial training method for generative models, sidestepping the inference and sampling difficulties of earlier deep generative approaches.

Our summary of the paper, not the authors' words — written to be readable without the field's vocabulary, from the stored copy of the paper and nothing else. Drafted with xai:grok-4.5 and checked by a person. The authors' own sentences are the quotes below.

Near this, by wording

Papers whose claims are worded most like this one's, found by the same hourly pass that draws the map. It is a measure of LANGUAGE, not of agreement or of citation: two papers can be near each other here and flatly contradict one another.

Yoshua Bengio did not write this page.

Every claim below was made in this piece, quoted word for word and numbered in the order the piece makes them, so you can read it there rather than take our word for it. The sentence above each quote is our reading of the claim, not their wording. Each quote was checked against a stored copy of the page at build time; where the two differ, the quote is the fact.

  1. There is no need for any Markov chains or unrolled approximate inference networks during either training or generation of samples.
  2. Deep generative models have had less of an impact, due to the difficulty of approximating many intractable probabilistic computations that arise in maximum likelihood estimation and related strategies, and due to difficulty of leveraging the benefits of piecewise linear units in the generative context.