Generative Adversarial Networks

Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza

2014 · NeurIPS

Generative Adversarial Networks

Problem

Framing

Generative models still leaned on explicit density estimation or slow Markov chains, both weak fits for sharp image synthesis. GANs replace both with a two-network minimax game that learns direct sampling without a tractable likelihood.

Currently Used Methods

Foundational

Proposed Method

Architecture

The method uses two feed-forward networks. The generator G(z;θg)G(\mathbf{z};\theta_g) maps latent noise to samples, and the discriminator D(x;θd)D(\mathbf{x};\theta_d) outputs the probability that x\mathbf{x} came from data. Training alternates gradient updates to both players.

Verified page crop: introductory diagrams contrasting explicit density estimation with GAN-style implicit generation from training examples.

Loss / Objective

The core learning rule is a minimax game.

minGmaxDV(D,G)=Expdata[logD(x)]+Ezpz[log(1D(G(z)))]\min_G \max_D V(D,G) = \mathbb{E}_{\mathbf{x} \sim p_{\mathrm{data}}}[\log D(\mathbf{x})] + \mathbb{E}_{\mathbf{z} \sim p_{\mathbf{z}}}[\log (1 - D(G(\mathbf{z})))]

Sampling Rule / Algorithm

Sampling is one generator forward pass from the latent prior.

zpz(z),xfake=G(z)\mathbf{z} \sim p_{\mathbf{z}}(\mathbf{z}), \qquad \mathbf{x}_{\mathrm{fake}} = G(\mathbf{z})

Training Procedure

Evaluation

Datasets

Metrics

Headline results

Table 1: The paper's main quantitative comparison is a Parzen-window log-likelihood table on MNIST, but the extracted crop is not the table itself. The visible inspected asset instead shows the 1-D training-dynamics schematic, so no faithful transcription is possible from the available image.

Verified schematic: two 1-D GAN training snapshots with latent points mapped upward, data points, model density, and discriminator curve.

Ablations

Method Strengths and Weaknesses

Strengths

Weaknesses

Suggestions from the authors

Links

Prior Papers

Further Papers