Is Minimax Optimization the Right Framework to Understand Learning in Minimax Games?
summary
Shows that Adam’s edge in GANs comes from its step-norm, not direction: reproducing Adam with a normalized SGD variant (AdaLR/AdaDIR) matches or beats Adam, and theory on a sparse linear generator plus cubic discriminator proves SGDA collapses to the mean while normalized SGDA recovers both modes. Recasts adversarial training as distributional robustness under an L∞ Wasserstein ball, uses entropic regularization to get p(x̃) ∝ exp(λ loss) and Langevin sampling, and reports 10×–30× speedup* on CIFAR/MNIST with the caveats of memory and augmentation handling.
AI-written summary · about
chapters (18)
- 0:00Intro
- 0:31Outline
- 2:32Training Dynamics
- 3:35Principled optimization for minimax games
- 4:51An inconvenient truth
- 8:34What does Adam do?
- 10:24What we did
- 16:29Analysis of Normalized SGDA VS SGDA
- 20:04Illustration: SGDA mode collapse (learn the average)
- 21:10Our Results: normalized SGDA
- 22:43Illustration normalized SGD learns both modes
- 25:55Adversarial examples
- 26:37Training robust models
- 29:58Distributional robustness perspective
- 31:59Insight from optimal transport
- 35:01Results: MNIST
- 36:22Results: CIFAR
- 37:33Conclusion (part 2)
related talks
01h 00mTutorial on Deep Learning IV
01h 01mOptimization's Untold Gift to Learning: Implicit Regularization
01h 17mImplicit Regularization I
44mRobust Estimation and Generative Adversarial Nets
01h 01mRobustness, Stochastics, Uncertainty 2
34mOffline Reinforcement Learning and Model-Based Optimization
01h 23mImplicit Regularization II
11mNonparametric Density Estimation and Convergence of GANs under Besov IPMs
