Research map / Optimization / Nonconvex and smooth optimization
Global Convergence to Local Minmax Equilibrium in Classes of Nonconvex Zero-Sum Games
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
- Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent (NeurIPS 2021 · similarity 0.93)
- Local Convergence Analysis of Gradient Descent Ascent with Finite Timescale Separation (ICLR 2021 · similarity 0.91)
- Solving Zero-Sum Convex Markov Games (ICML 2025 · similarity 0.90)
- Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms (NeurIPS 2024 · similarity 0.90)
- Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem (NeurIPS 2024 · similarity 0.90)
- Accelerated Regularized Learning in Finite N-Person Games (NeurIPS 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.