Research map / Optimization / Nonconvex and smooth optimization
Local Convergence Analysis of Gradient Descent Ascent with Finite Timescale Separation
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
- Global Convergence to Local Minmax Equilibrium in Classes of Nonconvex Zero-Sum Games (NeurIPS 2021 · similarity 0.91)
- Double-Step Alternating Extragradient with Increasing Timescale Separation for Finding Local Minimax Points: Provable Improvements (ICML 2024 · similarity 0.89)
- The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization (NeurIPS 2018 · similarity 0.88)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · similarity 0.87)
- Solving Neural Min-Max Games: The Role of Architecture, Initialization & Dynamics (NeurIPS 2025 · similarity 0.86)
- Accelerated Regularized Learning in Finite N-Person Games (NeurIPS 2024 · similarity 0.86)
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.