Preprint Article Version 1 This version is not peer-reviewed

Stable GANs via Fermi-Dirac Statistics and Ruppeiner Geometry

Version 1 : Received: 15 October 2024 / Approved: 16 October 2024 / Online: 16 October 2024 (11:48:02 CEST)

How to cite: Garayev, G.; Alili, A. Stable GANs via Fermi-Dirac Statistics and Ruppeiner Geometry. Preprints 2024, 2024101286. https://doi.org/10.20944/preprints202410.1286.v1 Garayev, G.; Alili, A. Stable GANs via Fermi-Dirac Statistics and Ruppeiner Geometry. Preprints 2024, 2024101286. https://doi.org/10.20944/preprints202410.1286.v1

Abstract

Generative Adversarial Networks (GANs) are powerful models for generative tasks but face significant challenges such as instability, mode collapse, and inefficient convergence. This paper introduces a theoretical framework leveraging Fermi-Dirac statistics, Ruppeiner geometry, phase transition dynamics, and graph theory to address these issues. The proposed theorems provide a robust mathematical foundation for enhancing GAN stability, diversity, and convergence. Experimental validation on the MNIST dataset demonstrates that the application of these theorems results in improved Inception Scores, reduced Fréchet Inception Distances, and stable training dynamics, as indicated by Ruppeiner curvature analysis. The findings suggest that these theoretical insights offer a comprehensive solution to the persistent challenges in GAN training, paving the way for more reliable and effective generative models.

Keywords

Supersymmetry; Generalization; Robustness; Adversarial Attacks; Parallel Transport; Loss Optimization; CIFAR-10

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.