AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile

ICLR 2019 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax · 114 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
Add an extra-gradient step to RMSpropRMSprop GAN training · 16-Gaussian GMMtarget-distribution learningHelped
Add an extra-gradient step to RMSpropRMSprop GAN training · 16-Gaussian GMMoscillatory behaviorHelped
Add an extra-gradient step to AdamAdam GAN training · 16-Gaussian GMMtarget-distribution learningHelped
Add an extra-gradient step to AdamAdam GAN training · 16-Gaussian GMMoscillatory behaviorHelped
Add an extra-gradient step to AdamWasserstein GAN · CelebAinception scoreHelped
Add an extra-gradient step to AdamWasserstein GAN · CelebAFréchet distanceHelped
Add an extra-gradient step to AdamWasserstein GAN · CIFAR-10inception scoreHelped
Add an extra-gradient step to AdamWasserstein GAN · CIFAR-10Fréchet distanceHelped
Use vanilla mirror descent instead of optimistic mirror descentMirror descent in null-coherent problems · Coherent saddle-point problemsconvergence to a solutionHurt

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