AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Accelerated Single-Call Methods for Constrained Min-Max Optimization

ICLR 2023 · Optimization › Nonconvex and smooth optimization · approach: Extragradient for variational inequalities · 3 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
Extend Optimistic Gradient to inclusion problems with one operator call and one resolvent call per iterationOptimistic Gradient (OG) · Weak MVI inclusion problemsbest-iterate tangent residual squared convergence rate: O(\frac{1}{T})Helped
Add Halpern-style anchoring to reflected gradient updatesReflected Gradient · Negatively comonotone inclusion problemslast-iterate tangent residual convergence rate: O(\frac{1}{T})Helped
Prove a finite last-iterate guarantee for the reflected gradient methodReflected Gradient (RG) · Convex-concave min-max optimizationlast-iterate tangent residual convergence rate: O(\frac{1}{\sqrt{T}})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