Papers › Unrolled Generative Adversarial Networks

Unrolled Generative Adversarial Networks

7 Nov 2016arXiv:1611.02163archive 2025-07-28

Luke Metz, Ben Poole, David Pfau, Jascha Sohl-Dickstein

We introduce a method to stabilize Generative Adversarial Networks (GANs) by defining the generator objective with respect to an unrolled optimization of the discriminator. This allows training to be adjusted between using the optimal discriminator in the generator's objective, which is ideal but infeasible in practice, and using the current value of the discriminator, which is often unstable and leads to poor solutions. We show how this technique solves the common problem of mode collapse, stabilizes training of GANs with complex recurrent generators, and increases diversity and coverage of the data distribution by the generator.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

poolio/unrolled_gan officialmentioned in papermentioned on GitHubtfMITSyntology: not harvested report
MarisaKirisame/unroll_gan mentioned on GitHubpytorchSyntology: not harvested report
alex98chen/testGAN mentioned on GitHubtfSyntology: not harvested report
andrewliao11/unrolled-gans mentioned on GitHubpytorchMITSyntology: not harvested report
apaszke/pytorch-dist mentioned on GitHubpytorchNOASSERTIONSyntology: not harvested report
chameleonTK/continual-learning-for-HAR mentioned on GitHubpytorchSyntology: not harvested report
locuslab/gradient_regularized_gan mentioned on GitHubtfSyntology: not harvested report
lyken17/pytorch mentioned on GitHubpytorchNOASSERTIONSyntology: not harvested report
mangoubi/Min-max-optimization-algorithm-for-training-GANs mentioned on GitHubtfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A Convergent and Dimension-Independent Min-Max Optimization Algorithm (arXiv:2006.12376; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Diversity

Datasets

Introduced by this paper, per the archive.

Stacked MNIST

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections