arXiv (All)
open access
Accelerating Min-Max Optimization via Power-Law Stepsizes
We revisit the convergence guarantees of the Extragradient (EG) method for unconstrained biaffine min-max optimization. It is known that EG with a fixed stepsize achieves a $Θ(T^{-1/2})$ last-iterate convergence rate, which is slower than the optimal $\mathcal{O}(T^{-1})$ rate attainable by incorpor
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Gradient Descent on Logistic Regression: Do Large Step-Sizes Work with Data on the Sphere?#1411719
- Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes#821653
- A Two-Dimensional Extremizer for Relatively Inexact Gradient Descent#1154779
- On Minimax Optimality and Uniqueness of Fixed-Step First-Order Methods for Smooth Convex Optimization#984578
- Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs II: Convex Optimization Problems#1533822
Record · ID 1534061
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive