AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

A Single-Loop Accelerated Extra-Gradient Difference Algorithm with Improved Complexity Bounds for Constrained Minimax Optimization

Yuanyuan Liu, Fanhua Shang, Weixin An, Junhao Liu, Hongying Liu, Zhouchen Lin

NeurIPS 2023 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 EGDA instead of GDA, EG and FEGsynthetic NC-NC minimax · f(x,y)=x^2+3sin^2x sin^2y-4y^2-10sin^2yconvergence speed (distance to saddle point, gradient norm)Improved
use EGDA instead of FEG despite FEG's O(1/t^2) theoretical rate under negative monotonicitysynthetic NC-NC minimax · f(x,y)=x^2+3sin^2x sin^2y-4y^2-10sin^2yconvergence speedImproved
use EGDA instead of GDA and EAGconvex-concave problem · f(x,y)=log(1+e^x)+3xy-log(1+e^y)distance to saddle pointImproved
GDA with same small step-size as other methodsGDA · convex-concave problemconvergence to stationary pointHurt
use EGDA instead of GDA and MGDA for robust trainingadversarial training (NC-C) · Fashion MNIST and MNISTtraining loss convergence speedImproved
use EGDA instead of Smoothed-GDAadversarial training (NC-C) · Fashion MNIST and MNISTtraining loss convergence speedImproved

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