A Distributed Training Algorithm of Generative Adversarial Networks with Quantized Gradients
Xiaojun Chen, Shu Yang, Li Shen, Xuanrong Pang

TL;DR
This paper introduces DQGAN, a distributed GAN training algorithm with quantized gradients that reduces communication costs and maintains convergence, enabling efficient training on large datasets with minimal performance loss.
Contribution
It presents the first distributed GAN training method with quantized gradients, incorporating an error-feedback mechanism to ensure convergence under gradient compression.
Findings
Reduces communication cost significantly
Achieves linear speedup in distributed training
Maintains comparable performance with less communication
Abstract
Training generative adversarial networks (GAN) in a distributed fashion is a promising technology since it is contributed to training GAN on a massive of data efficiently in real-world applications. However, GAN is known to be difficult to train by SGD-type methods (may fail to converge) and the distributed SGD-type methods may also suffer from massive amount of communication cost. In this paper, we propose a {distributed GANs training algorithm with quantized gradient, dubbed DQGAN,} which is the first distributed training method with quantized gradient for GANs. The new method trains GANs based on a specific single machine algorithm called Optimistic Mirror Descent (OMD) algorithm, and is applicable to any gradient compression method that satisfies a general -approximate compressor. The error-feedback operation we designed is used to compensate for the bias caused by the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Face recognition and analysis · Human Pose and Action Recognition
