Research map / Optimization / Nonconvex and smooth optimization
Generalized Natural Gradient Flows in Hidden Convex-Concave Games and GANs
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.92)
- Solving Neural Min-Max Games: The Role of Architecture, Initialization & Dynamics (NeurIPS 2025 · similarity 0.91)
- Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games (NeurIPS 2019 · similarity 0.90)
- Exploiting hidden structures in non-convex games for convergence to Nash equilibrium (NeurIPS 2023 · similarity 0.89)
- The Mechanics of n-Player Differentiable Games (ICML 2018 · similarity 0.89)
- Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem (NeurIPS 2024 · similarity 0.87)
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.