RG-GAN: Dynamic Regenerative Pruning for Data-Efficient Generative Adversarial Networks
Divya Saxena, Jiannong Cao, Jiahao Xu, Tarun Kulshrestha
Abstract
Training Generative Adversarial Networks (GAN) to generate high-quality images typically requires large datasets. Network pruning during training has recently emerged as a significant advancement for data-efficient GAN. However, simple and straightforward pruning can lead to the risk of losing key information, resulting in suboptimal results due to GAN’s competitive dynamics between generator (G) and discriminator (D). Addressing this, we present RG-GAN, a novel approach that marks the first incorporation of dynamic weight regeneration and pruning in GAN training to improve the quality of the generated samples, even with limited data. Specifically, RG-GAN initiates layer-wise dynamic pruning by removing less important weights to the quality of the generated images. While pruning enhances efficiency, excessive sparsity within layers can pose a risk of model collapse. To mitigate this issue, RG-GAN applies a dynamic regeneration method to reintroduce specific weights when they become important, ensuring a balance between sparsity and image quality. Though effective, the sparse network achieved through this process might eliminate some weights important to the combined G and D performance, a crucial aspect for achieving stable and effective GAN training. RG-GAN addresses this loss of weights by integrating learned sparse network weights back into the dense network at the previous stage during a follow-up regeneration step. Our results consistently demonstrate RG-GAN’s robust performance across a variety of scenarios, including different GAN architectures, datasets, and degrees of data scarcity, reinforcing its value as a generic training methodology. Results also show that data augmentation exhibits improved performance in conjunction with RG-GAN. Furthermore, RG-GAN can achieve fewer parameters without compromising, and even enhancing, the quality of the generated samples. Code can be found at this link: https://github.com/IntellicentAI-Lab/RG-GAN
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5e827a52-3fdf-49b1-a05c-c35d1b7f4cc7Cited by top-tier papers1
Ask how each one uses itBuilds on11
- Differentiable Augmentation for Data-Efficient GAN TrainingShengyu Zhao, Zhijian Liu, Ji Lin, Jun-Yan Zhu et al.NeurIPS 2020 · 707 citations
- Towards Faster and Stabilized GAN Training for High-fidelity Few-shot Image SynthesisBingchen Liu, Yizhe Zhu, Kunpeng Song, Ahmed ElgammalICLR 2021 · 307 citations
- Consistency Regularization for Generative Adversarial NetworksHan Zhang, Zizhao Zhang, Augustus Odena, Honglak LeeICLR 2020 · 305 citations
- Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked LayersJunjie Liu, Zhe Xu, Runbin Shi, Ray C. C. Cheung et al.ICLR 2020 · 136 citations
- Deceive D: Adaptive Pseudo Augmentation for GAN Training with Limited DataLiming Jiang, Bo Dai, Wayne Wu, Chen Change LoyNeurIPS 2021 · 133 citations
Related papers
- DigGAN: Discriminator gradIent Gap Regularization for GAN Training with Limited DataTiantian Fang, Ruoyu Sun, Alexander G. SchwingNeurIPS 2022 · 27 citations
- Balanced Training for Sparse GANsYite Wang, Jing Wu, Naira Hovakimyan, Ruoyu SunNeurIPS 2023 · 16 citations
- Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket PerspectiveTianlong Chen, Yu Cheng, Zhe Gan, Jingjing Liu et al.NeurIPS 2021 · 61 citations
- FreGAN: Exploiting Frequency Components for Training GANs under Limited DataMengping Yang, Zhe Wang, Ziqiu Chi, Yanbing ZhangNeurIPS 2022 · 49 citations
- Improving the Training of the GANs with Limited Data via Dual Adaptive Noise InjectionZhaoyu Zhang, Yang Hua, Guanxiong Sun, Hui Wang et al.ACM MM 2024 · 3 citations
