AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Weaker MVI Condition: Extragradient Methods with Multi-Step Exploration

Yifeng Fan, Yongqiang Li, Bo Chen

ICLR 2024 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a multi-step extragradient framework for nonconvex-nonconcave min-max problems that works under a weaker MVI (minty variational inequality) condition.

Problem

Solving nonconvex-nonconcave min-max optimization problems (e.g., GAN training), where standard convex-concave methods and existing extragradient analyses face convergence difficulties under restrictive assumptions.

Approach

Extends the extragradient algorithm to a multi-step exploration scheme and proves convergence under a weaker Minty variational inequality condition than previously assumed.

Experimental setup

Builds on: extragradient

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