The GAN is dead; long live the GAN! A Modern GAN Baseline

Yiwen Huang, Aaron Gokaslan, Volodymyr Kuleshov, James Tompkin
1/9/2025
cs.LGcs.CV

No official code found. Best implementation: brownvc/R3GAN (876 stars, last commit 2025-01-23).

Abstract

There is a widely-spread claim that GANs are difficult to train, and GAN architectures in the literature are littered with empirical tricks. We provide evidence against this claim and build a modern GAN baseline in a more principled manner. First, we derive a well-behaved regularized relativistic GAN loss that addresses issues of mode dropping and non-convergence that were previously tackled via a bag of ad-hoc tricks. We analyze our loss mathematically and prove that it admits local convergence guarantees, unlike most existing relativistic losses. Second, our new loss allows us to discard all ad-hoc tricks and replace outdated backbones used in common GANs with modern architectures. Using StyleGAN2 as an example, we present a roadmap of simplification and modernization that results in a new minimalist baseline -- R3GAN. Despite being simple, our approach surpasses StyleGAN2 on FFHQ, ImageNet, CIFAR, and Stacked MNIST datasets, and compares favorably against state-of-the-art GANs and diffusion models.

View on arXivView PDF

Code Implementations(1)

brownvc/R3GANCommunity100%

Code for NeurIPS 2024 paper - The GAN is dead; long live the GAN! A Modern Baseline GAN - by Huang et al.

87645C++, CudaOct 30, 20241 years ago

Similar Papers

Cite this paper

@article{huang2025dead,
  title  = {The GAN is dead; long live the GAN! A Modern GAN Baseline},
  author = {Yiwen Huang and Aaron Gokaslan and Volodymyr Kuleshov and James Tompkin},
  year   = {2025},
  eprint = {2501.05441},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.05441v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.05441.svg)](https://codeofpaper.com/paper/2501.05441)

Discussion