Research map / Optimization / Nonconvex and smooth optimization
A Catalyst Framework for Minimax Optimization
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 |
|---|---|---|---|
| Wrap extragradient in the Catalyst scheme with tau=mu, instead of running EG directly, using same stepsizes | EG · Wireless channel capacity SC-C minimax, two synthetic datasets | convergence vs gradient count | Helped |
| Use Catalyst-EG instead of DIAG | Catalyst-EG · Wireless channel capacity, Dataset 2 | convergence vs gradient count | Helped |
| Wrap SVRG in the Catalyst scheme | SVRG · Wireless channel capacity, Dataset 1 | convergence vs gradient count | Helped |
Closest papers by meaning
- Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints (NeurIPS 2024 · similarity 0.89)
- Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization (NeurIPS 2024 · similarity 0.89)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · similarity 0.89)
- Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion (ICML 2024 · similarity 0.88)
- Second-Order Min-Max Optimization with Lazy Hessians (ICLR 2025 · similarity 0.88)
- Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization (NeurIPS 2024 · similarity 0.88)
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.