Research map / Optimization / Nonconvex and smooth optimization
Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems
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.
Closest papers by meaning
- On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems (ICML 2020 · similarity 0.93)
- Global Convergence and Variance Reduction for a Class of Nonconvex-Nonconcave Minimax Problems (NeurIPS 2020 · similarity 0.92)
- A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems (NeurIPS 2020 · similarity 0.90)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.90)
- Fundamental Benefit of Alternating Updates in Minimax Optimization (ICML 2024 · similarity 0.89)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · 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.