atlas

Research map / Optimization / Nonconvex and smooth optimization

SGDA with shuffling: faster convergence for nonconvex-PŁ minimax optimization

ICLR 2023 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax · 0 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
random reshuffling (without-replacement) instead of with-replacement sampling in SGDAsimSGDA and altSGDA · quadratic games (P-L(Phi)-SC)potential function V_lambda convergenceHelped
simultaneous vs alternating updates under RRSGDA-RR · quadratic games (P-L(Phi)-SC)potential function V_lambda convergenceNo clear effect
step size ratio r=beta/alpha below kappa_2 makes simGDA impossible to converge; r of order kappa_2^2 gives tight upper bound K=O(kappa_1 r log(1/eps))full-batch simGDA · SC-SC and P-L(Phi)-P-L functionsiteration complexityMixed
mini-batch size b increased from 1 toward n (GDA) under RRSGDA-RR · nonconvex-PL theoryconvergence boundNo clear effect

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