AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization

Tianyi Lin, Chi Jin, Michael I. Jordan

JMLR 2025 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax

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 two-timescale updates (TTGDA) instead of GDmaxrobust logistic regression with nonconvex penalty · 6 LIBSVM datasetsconvergence speedImproved
use TTSGDA instead of Adam and RMSpropWGAN with linear generator · WGAN linear generator (1D Gaussian)gradient normImproved
use TTSGDA instead of Adam and RMSpropWGAN with ReLU generator · WGAN nonlinear generator (1 hidden layer, 5 neurons)gradient normHurt

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