atlas

Research map / Optimization / Nonconvex and smooth optimization

Stability and Generalization of Stochastic Gradient Methods for Minimax Problems

ICML 2021 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax · 8 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
Increase the step sizeSOLAM (SGDA) · svmguide3 and w5adistance between models trained on neighboring datasetsHurt
Continue training for more passesSOLAM (SGDA) · svmguide3 and w5adistance between models trained on neighboring datasetsHurt
Use SGDA with early stopping and an appropriate iteration count and step sizeConvex-concave minimax optimization · Convex-concave problemsweak PD population risk: O(1/\sqrt{n})Helped
Use SGDA without requiring smoothnessStrongly-convex-strongly-concave minimax optimization · Strongly-convex-strongly-concave problemsweak PD population risk: O(\sqrt{\log n}/(n\rho))Helped
Allow weak-convexity-weak-concavity to decay along optimizationSGDA · Decaying weak-convexity-weak-concavity problemsweak PD generalization: O\big(1/\sqrt{n}+\sqrt{T}/n\big)Helped

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