Deep Dive into GANs: The Math Behind Generative Adversarial Networks
This post delves into the mathematical foundations of Generative Adversarial Networks (GANs). Starting with the basic concepts, the author meticulously explains the loss functions of the generator and discriminator, deriving conditions for optimal discriminator and generator. Using mathematical tools like binary cross-entropy and JS divergence, the adversarial process between generator and discriminator during GAN training is clearly illustrated. The ultimate goal is to make the distribution of generated data as close as possible to that of real data. The post also briefly introduces GAN training methods and highlights subtle differences in formulas compared to Goodfellow's original paper.
Read more