Back to blogThe GAN Minimax
The GAN Minimax Objective Function
·1 min read
deep-learninggansgenerative-models
Generative Adversarial Networks
The GAN Minimax
Objective Function
An interactive visual tour of why GANs use log, what minG maxD really means, and how the two-player game reaches Nash equilibrium.
Share this post
More posts
The Monty Hall Problem: Why Your Gut Is Wrong, and How to Prove It
The Monty Hall problem looks like a 50/50 coin flip but isn't. This post lets you play the game, watch the probability equation update live as you add doors, and run a Monte Carlo simulation of a hundred thousand games to see intuition and math collide.
The Curse of Dimensionality: Why Geometric Deep Learning Has to Exist
Learning in high dimensions is impossible without assumptions. This post walks through the error decomposition behind every ML model, shows how the curse of dimensionality attacks each piece, and explains why exploiting geometry is the only known escape.