PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
December 1, 2025Foundations of Computing and Decision Sciences0 citationsOpen Access

f -divergence Analysis of Generative Adversarial Network

View Full Paper
MHMahmud HasanHSHailin Sang

Key Points

  • Kullback-Leibler divergence estimation bounds achieve better results with the generative adversarial network paradigm, especially in different scenarios.
  • The inequality derived facilitates almost surely convergence rates for total variation and Kullback-Leibler divergence within the GAN model.
  • The analysis determines expected outputs of the discriminator when comparing real data to generated data, highlighting a significant advancement over previous works.
  • This inquiry emphasizes the applicability of derived inequalities for enhancing GAN performance in various divergence metrics.

Abstract

Abstract We aim to establish estimation bounds for various divergences, including total variation, Kullback-Leibler (KL) divergence, Hellinger divergence, and Pearson χ 2 divergence, within the GAN estimator. We derive an inequality based on empirical and population objective functions of the GAN model, achieving almost surely convergence rates. Subsequently, this inequality was employed to derive estimation bounds for total variation, Kullback-Leibler (KL) divergence, Hellinger divergence, and Pearson χ 2 divergence, leading to almost surely convergence rates and differences between the expected outputs of the discriminator on real data and generated data. Our study demonstrates better results compared to some existing ones, which are a specific case of the general objective function.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Hasan et al. (2025) studied this question.

synapsesocial.com/papers/69402a7e2d562116f29020eehttps://doi.org/10.2478/fcds-2025-0018
Ask AI
Helpful
Bookmark
Share
View Full Paper