Research map / Optimization / Nonconvex and smooth optimization
GDA-AM: ON THE EFFECTIVENESS OF SOLVING MIN-IMAX OPTIMIZATION VIA ANDERSON MIXING
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 Convergence of Gradient Descent Ascent: A Tight Local Analysis (ICML 2022 · similarity 0.91)
- Train simultaneously, generalize better: Stability of gradient-based minimax learners (ICML 2021 · similarity 0.90)
- Fundamental Benefit of Alternating Updates in Minimax Optimization (ICML 2024 · similarity 0.89)
- The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization (NeurIPS 2018 · similarity 0.88)
- On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems (ICML 2020 · similarity 0.88)
- Delving into the Convergence of Generalized Smooth Minimax Optimization (ICML 2024 · similarity 0.85)
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.