AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Last-Iterate Convergence of Optimistic Gradient Method for Monotone Variational Inequalities

Eduard Gorbunov, Adrien Taylor, Gauthier Gidel

NeurIPS 2022 · Optimization › Nonconvex and smooth optimization · approach: Extragradient for variational inequalities · 3 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
keep only distance-1 constraints in the SDP for OG instead of PEG (ablation)performance estimation SDP of Optimistic Gradient (OG) vs PEG · worst-case SDP relaxationworst-case bound vs NHurt
use simplified OG SDP in place of PEG SDPworst-case analysis · SDP numerical boundworst-case squared operator normNo clear effect
compare derived Theorem 1 bound to numerically found boundPEG with gamma=1/3L · N=50upper bound on ||F(x_N)||^2: approx 20 times worseHurt

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