MSG-GAN: Multi-Scale Gradients for Generative Adversarial Networks
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7ZWQIJ4Xrecord.jsonopen to challenge →
read the original abstract
While Generative Adversarial Networks (GANs) have seen huge successes in image synthesis tasks, they are notoriously difficult to adapt to different datasets, in part due to instability during training and sensitivity to hyperparameters. One commonly accepted reason for this instability is that gradients passing from the discriminator to the generator become uninformative when there isn't enough overlap in the supports of the real and fake distributions. In this work, we propose the Multi-Scale Gradient Generative Adversarial Network (MSG-GAN), a simple but effective technique for addressing this by allowing the flow of gradients from the discriminator to the generator at multiple scales. This technique provides a stable approach for high resolution image synthesis, and serves as an alternative to the commonly used progressive growing technique. We show that MSG-GAN converges stably on a variety of image datasets of different sizes, resolutions and domains, as well as different types of loss functions and architectures, all with the same set of fixed hyperparameters. When compared to state-of-the-art GANs, our approach matches or exceeds the performance in most of the cases we tried.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Hard-Aware Fashion Attribute Classification
Presents HABP to emphasize hard samples during training and Deact to generate stable synthetic samples for rare attributes, outperforming prior methods on large-scale fashion datasets without extra supervision.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.