Composite Functional Gradient Learning of Generative Adversarial Models
Not on the map. Why?
Abstract (arXiv)
This paper first presents a theory for generative adversarial methods that does not rely on the traditional minimax formulation. It shows that with a strong discriminator, a good generator can be learned so that the KL divergence between the distributions of real data and generated data improves after each functional gradient step until it converges to zero. Based on the theory, we propose a new stable generative adversarial method. A theoretical insight into the original GAN from this new viewpoint is also provided. The experiments on image generation show the effectiveness of our new method.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Jan 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 2; 2024: 0; 2025: 1; 2026: 1.
6 papers.
- 2021Deep Generative Learning via Schr"odinger Bridgecited by 103
- 2023Gaussian Interpolation Flowscited by 17
- 2023MonoFlow: Rethinking Divergence GANs via the Perspective of Wasserstein Gradient Flowscited by 12
- 2021Trust the Critics: Generatorless and Multipurpose WGANs with Initial Convergence Guaranteescited by 1
- 2025Nested Annealed Training Scheme for Generative Adversarial Networkscited by 0
- 2026Rethinking the Flow-Based Gradual Domain Adaptation: A Semi-Dual Optimal Transport Perspectivecited by 0
- 2026Rethinking the Flow-Based Gradual Domain Adaptation: A Semi-Dual Optimal Transport Perspective1 Feb 2026
- 2025Nested Annealed Training Scheme for Generative Adversarial Networks20 Jan 2025
- 2023Gaussian Interpolation Flows20 Nov 2023
- 2023MonoFlow: Rethinking Divergence GANs via the Perspective of Wasserstein Gradient Flows2 Feb 2023
- 2021Trust the Critics: Generatorless and Multipurpose WGANs with Initial Convergence Guarantees30 Nov 2021
- 2021Deep Generative Learning via Schr"odinger Bridge19 Jun 2021