built throughORANGEBOX·see what it ships·$1 →

AtomEons / Research / Decoded / Generative Adversarial Networks

Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, Yoshua Bengio — Université de Montréal — June 2014 · arXiv:1406.2661

Generative Adversarial Networks

Two neural networks compete — one tries to forge realistic data, the other tries to spot the forgery — and the forger gets so good that its fakes become indistinguishable from real samples.

01

What scientists actually did

Goodfellow set up a game between two neural networks. **The Generator (G)** is given random noise — basically a vector of random numbers — and has to turn it into something that looks like a real image (or real data of any kind). It starts out producing pure garbage. **The Discriminator (D)** is given either a real image from the training set or a fake one from G. Its job is to output a probability — how likely is this real? Both networks train at the same time. D gets better at spotting fakes. G gets better at fooling D. The mathematical setup is a minimax game: G is trying to minimize the same loss function D is trying to maximize. In theory, the equilibrium point — where neither side can improve — is reached when G's output distribution exactly matches the real data distribution and D is reduced to guessing 50/50. Goodfellow proved this convergence point exists mathematically. He then trained the system on MNIST handwritten digits, the Toronto Face Database, and CIFAR-10. The samples were recognizable as digits and faces but blurry and limited. The contribution was the *framework*, not the picture quality. Crucially, the training procedure alternates: a few steps of training D, then a step of training G, then back to D. The generator never sees the real data directly. It only learns from D's gradient — the signal "here is which direction makes me more fooled." The whole training loop fits on roughly one page of pseudocode. That economy is part of why the idea spread so fast.

02

What scientists know but rarely say

GANs are notoriously hard to train. The original paper is honest about this in a quiet way, but the difficulty became a research-community open secret for years afterward. **Mode collapse.** The generator often finds one or two outputs that fool the discriminator and just produces those over and over. Train a GAN on a face dataset and you might get one slightly-varying face instead of a diverse population. Fixing this took years of follow-up papers (Wasserstein GAN, spectral normalization, gradient penalty). **No likelihood, no evaluation metric.** Unlike most statistical models, GANs do not give you a probability of "how likely is this sample." You cannot ask the model "how good are you?" in a principled way. The field invented metrics like Fréchet Inception Distance years later, and they are all proxies. **Training is unstable by default.** The minimax objective creates oscillations. The discriminator wins → no gradient for the generator. The generator wins → discriminator becomes useless. Many published "GAN improvements" were really just engineering tricks to keep training from diverging. **Diffusion models won.** Since roughly 2021–2022, denoising diffusion has eaten GANs' lunch on image generation quality. Most state-of-the-art image generators today (Stable Diffusion, DALL-E 3, Midjourney) are not GANs. GANs are still used — they are fast at inference time, which matters for real-time applications — but they are no longer the frontier for raw quality. This paper is now ancestral, not current state-of-the-art. **The 2014 results were not photorealistic.** The famous "this person does not exist" faces came from StyleGAN2 in 2019, after five years of architectural work, regularization improvements, and large-scale curated face datasets. The original GAN paper showed a *proof of concept*, not a product.

03

What the paper does NOT claim

The paper does not claim GANs produce photorealistic anything. The 2014 samples are deliberately small and acknowledged as preliminary. It does not claim convergence is achievable in practice. The proof of equilibrium assumes ideal conditions (infinite capacity networks, perfect optimization). Real-world training does not reliably hit equilibrium — the paper notes this explicitly. It does not claim GANs are the best generative model. It compares to existing methods (variational autoencoders, deep Boltzmann machines, noise-contrastive estimation) and positions GANs as a new option with different tradeoffs — not a winner. It does not claim anything about deepfakes, face generation, art, copyright, or misuse. The word "deepfake" did not exist yet. The paper is a clean technical contribution that the world later wrapped in a moral panic. It does not invent adversarial training broadly. Adversarial examples (Szegedy 2013, Goodfellow's own work) and game-theoretic learning are older. This paper invents the specific *generator vs. discriminator* setup for generative modeling. It does not claim the discriminator's gradient is the only way to train G — the paper proposes a practical heuristic variant (maximize log D(G(z)) instead of minimize log(1 - D(G(z)))) because the original objective has weak gradient when G is bad, and openly notes this is a practical hack rather than the pure theoretical formulation.

04

Read the original

1. Goodfellow et al. 2014, "Generative Adversarial Nets" — the paper itself: https://arxiv.org/abs/1406.2661 2. Radford, Metz, Chintala 2015, "Unsupervised Representation Learning with Deep Convolutional GANs" (DCGAN) — the first GAN that produced clearly recognizable faces and bedrooms: https://arxiv.org/abs/1511.06434 3. Karras et al. 2019, "A Style-Based Generator Architecture for GANs" (StyleGAN) — the architecture behind thispersondoesnotexist.com: https://arxiv.org/abs/1812.04948 4. Arjovsky, Chintala, Bottou 2017, "Wasserstein GAN" — the most-cited fix for training instability: https://arxiv.org/abs/1701.07875 5. Goodfellow's NeurIPS 2016 tutorial, "Generative Adversarial Networks" — author's own retrospective with practical training advice: https://arxiv.org/abs/1701.00160
LAB · ATOMEONS · MARCO ISLAND FLÆONS RESEARCH · 12 PAPERS · CC-BY 4.0ORANGEBOX v1.0.0-beta · TURBO-OPTIMIZE CLAUDE · SHIPPED 2026-05-30B00KMAKR v3.2.0 · AI PUBLISHING COCKPIT · MAC + WINDOWSFREE LAUNCH WEEK · ENDS JUNE 6 · §4A NO-SAAS LOCKFOUNDER'S VIEW · NEXT BROADCAST IN ...CITE THE WORK · FORWARD THE LINK · NO ALGORITHMLAB · ATOMEONS · MARCO ISLAND FLÆONS RESEARCH · 12 PAPERS · CC-BY 4.0ORANGEBOX v1.0.0-beta · TURBO-OPTIMIZE CLAUDE · SHIPPED 2026-05-30B00KMAKR v3.2.0 · AI PUBLISHING COCKPIT · MAC + WINDOWSFREE LAUNCH WEEK · ENDS JUNE 6 · §4A NO-SAAS LOCKFOUNDER'S VIEW · NEXT BROADCAST IN ...CITE THE WORK · FORWARD THE LINK · NO ALGORITHM