Balanced Training for Sparse GANs

Yite Wang, Jing Wu, N. Hovakimyan, Ruoyu Sun
2/12/2026

No official code found. Best implementation: YiteWang/ADAPT (5 stars, last commit 2023-12-09).

Abstract

Over the past few years, there has been growing interest in developing larger and deeper neural networks, including deep generative models like generative adversarial networks (GANs). However, GANs typically come with high computational complexity, leading researchers to explore methods for reducing the training and inference costs. One such approach gaining popularity in supervised learning is dynamic sparse training (DST), which maintains good performance while enjoying excellent training efficiency. Despite its potential benefits, applying DST to GANs presents challenges due to the adversarial nature of the training process. In this paper, we propose a novel metric called the balance ratio (BR) to study the balance between the sparse generator and discriminator. We also introduce a new method called balanced dynamic sparse training (ADAPT), which seeks to control the BR during GAN training to achieve a good trade-off between performance and computational cost. Our proposed method shows promising results on multiple datasets, demonstrating its effectiveness.

View on arXivView PDF

Code Implementations(1)

YiteWang/ADAPTCommunity100%

[NeurIPS'2023] Balanced Training for Sparse GANs

50C++, CudaOct 7, 20232 years ago

Similar Papers

Cite this paper

@article{wang2026balanced,
  title  = {Balanced Training for Sparse GANs},
  author = {Yite Wang and Jing Wu and N. Hovakimyan and Ruoyu Sun},
  year   = {2026},
  eprint = {2302.14670},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2302.14670},
  journal = {NEURIPS 2023 2023}
}

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

Discussion