A New Formulation of Lipschitz Constrained With Functional Gradient Learning for GANs
Chang Wan, Ke Fan, Xinwei Sun, Yanwei Fu, Minglu Li, Yunliang Jiang,, Zhonglong Zheng

TL;DR
This paper proposes a novel Lipschitz-constrained functional gradient method for GANs, enhancing training stability and sample diversity by controlling the discriminator's gradient norm with a new penalty.
Contribution
It introduces Li-CFG, a new GAN training framework with a theoretical basis for increasing sample diversity, and an psilon-centered gradient penalty for effective discriminator gradient norm enlargement.
Findings
Improved stability in GAN training.
Enhanced diversity of generated samples.
Validated on benchmark image datasets.
Abstract
This paper introduces a promising alternative method for training Generative Adversarial Networks (GANs) on large-scale datasets with clear theoretical guarantees. GANs are typically learned through a minimax game between a generator and a discriminator, which is known to be empirically unstable. Previous learning paradigms have encountered mode collapse issues without a theoretical solution. To address these challenges, we propose a novel Lipschitz-constrained Functional Gradient GANs learning (Li-CFG) method to stabilize the training of GAN and provide a theoretical foundation for effectively increasing the diversity of synthetic samples by reducing the neighborhood size of the latent vector. Specifically, we demonstrate that the neighborhood size of the latent vector can be reduced by increasing the norm of the discriminator gradient, resulting in enhanced diversity of synthetic…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage and Signal Denoising Methods · Neural Networks and Applications
