atlas

Research map / Optimization / Nonconvex and smooth optimization

Train simultaneously, generalize better: Stability of gradient-based minimax learners

ICML 2021 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax · 6 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use PPM instead of GDABilinear convex-concave minimax learning · Bilinear convex-concave Gaussiangeneralization risk: 6.2; below 0.5Helped
Use simultaneous 1,1 Adam updates instead of 1,100 updatesSN-GAN · CIFAR-10generalization gapHelped
Use simultaneous 1,1 Adam updates instead of 1,100 updatesSN-GAN · CelebAgeneralization gapHelped
Use full-batch instead of stochastic updatesGDA · Strongly-convex strongly-concave Gaussiangeneralization risk: below an amplitude of 0.2; vanishingHelped
Use full-batch instead of stochastic updatesGDA · Bilinear convex-concave Gaussiangeneralization risk: 6.2; 7.8Hurt
Use full-batch instead of stochastic updatesPPM · Convex-concave Gaussiangeneralization riskHelped
Fully optimize the maximization player at each minimization stepSN-GAN · CIFAR-10 and CelebAgeneralization gapHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy