UCD: Unconditional Discriminator Promotes Nash Equilibrium in GANs

Mengfei Xia, Nan Xue, Jiapeng Zhu, Yujun Shen
10/1/2025
cs.CV

No confident code implementation found for this paper.

Abstract

Adversarial training turns out to be the key to one-step generation, especially for Generative Adversarial Network (GAN) and diffusion model distillation. Yet in practice, GAN training hardly converges properly and struggles in mode collapse. In this work, we quantitatively analyze the extent of Nash equilibrium in GAN training, and conclude that redundant shortcuts by inputting condition in $D$ disables meaningful knowledge extraction. We thereby propose to employ an unconditional discriminator (UCD), in which $D$ is enforced to extract more comprehensive and robust features with no condition injection. In this way, $D$ is able to leverage better knowledge to supervise $G$, which promotes Nash equilibrium in GAN literature. Theoretical guarantee on compatibility with vanilla GAN theory indicates that UCD can be implemented in a plug-in manner. Extensive experiments confirm the significant performance improvements with high efficiency. For instance, we achieved \textbf{1.47 FID} on the ImageNet-64 dataset, surpassing StyleGAN-XL and several state-of-the-art one-step diffusion models. The code will be made publicly available.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{xia2025ucd,
  title  = {UCD: Unconditional Discriminator Promotes Nash Equilibrium in GANs},
  author = {Mengfei Xia and Nan Xue and Jiapeng Zhu and Yujun Shen},
  year   = {2025},
  eprint = {2510.00624},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.00624v1}
}

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/2510.00624.svg)](https://codeofpaper.com/paper/2510.00624)

Discussion