Research map / Optimization / Nonconvex and smooth optimization
Adaptive Extra-Gradient Methods for Min-Max Optimization and 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use AdaProx instead of EG or BL | 100×100 stochastic bilinear game · Bilinear min-max game | squared gradient norm | Helped |
| Use AdaProx instead of EG or BL | non-convex/non-concave covariance learning game · Covariance matrix learning | squared norm of the vector field | Helped |
Closest papers by meaning
- Rapid Learning in Constrained Minimax Games with Negative Momentum (AAAI 2025 · similarity 0.89)
- Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion (ICML 2024 · similarity 0.88)
- Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization (NeurIPS 2024 · similarity 0.88)
- Accelerated Regularized Learning in Finite N-Person Games (NeurIPS 2024 · similarity 0.87)
- Fundamental Benefit of Alternating Updates in Minimax Optimization (ICML 2024 · similarity 0.87)
- Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis (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.