~/talk

Is Minimax Optimization the Right Framework to Understand Learning in Minimax Games?

slides:none on file

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

  1. 0:00Intro
  2. 0:31Outline
  3. 2:32Training Dynamics
  4. 3:35Principled optimization for minimax games
  5. 4:51An inconvenient truth
  6. 8:34What does Adam do?
  7. 10:24What we did
  8. 16:29Analysis of Normalized SGDA VS SGDA
  9. 20:04Illustration: SGDA mode collapse (learn the average)
  10. 21:10Our Results: normalized SGDA
  11. 22:43Illustration normalized SGD learns both modes
  12. 25:55Adversarial examples
  13. 26:37Training robust models
  14. 29:58Distributional robustness perspective
  15. 31:59Insight from optimal transport
  16. 35:01Results: MNIST
  17. 36:22Results: CIFAR
  18. 37:33Conclusion (part 2)
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.