Research map / Optimization / Nonconvex and smooth optimization
A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
Jun-Lin Wang, Zi Xu, Hui-Ling Zhang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 second-order methods instead of first-order extragradient | synthetic cubic minimax problem (n=50,100) · Synthetic minimax | gradient norm vs iterations | Improved |
| use LF-CR and FF-CR over other second-order methods | second-order solvers · Synthetic minimax | gradient norm vs iterations | Improved |
| use FF-CR over baselines on AUC maximization | AUC maximization (a9a, w8a) · AUC maximization | gradient norm vs iterations | Improved |
Closest papers by meaning
- Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization (NeurIPS 2024 · similarity 0.91)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · similarity 0.88)
- Second-Order Min-Max Optimization with Lazy Hessians (ICLR 2025 · similarity 0.88)
- Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods (ICLR 2025 · similarity 0.88)
- Delving into the Convergence of Generalized Smooth Minimax Optimization (ICML 2024 · similarity 0.88)
- Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization (AAAI 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.
