Research map / Optimization / Nonconvex and smooth optimization
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
Tianyi Lin, Chi Jin, Michael I. Jordan
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use two-timescale updates (TTGDA) instead of GDmax | robust logistic regression with nonconvex penalty · 6 LIBSVM datasets | convergence speed | Improved |
| use TTSGDA instead of Adam and RMSprop | WGAN with linear generator · WGAN linear generator (1D Gaussian) | gradient norm | Improved |
| use TTSGDA instead of Adam and RMSprop | WGAN with ReLU generator · WGAN nonlinear generator (1 hidden layer, 5 neurons) | gradient norm | Hurt |
Closest papers by meaning
- On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems (ICML 2020 · similarity 0.96)
- Global Convergence and Variance Reduction for a Class of Nonconvex-Nonconcave Minimax Problems (NeurIPS 2020 · similarity 0.93)
- Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems (NeurIPS 2022 · similarity 0.92)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.90)
- Double-Step Alternating Extragradient with Increasing Timescale Separation for Finding Local Minimax Points: Provable Improvements (ICML 2024 · similarity 0.90)
- Fundamental Benefit of Alternating Updates in Minimax Optimization (ICML 2024 · similarity 0.89)
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.
