arxiv
PublishedJune 2, 2026 at 4:00 AM
Accelerating Min-Max Optimization via Power-Law Stepsizes
Publisher summary· verbatim
arXiv:2606.01764v1 Announce Type: cross Abstract: 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 $\Theta(T^{-1/2})$ last-iterate convergence rate, which is slower than the op
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSFMambaNet: Spectral-Frequency Enhanced Selective State Space Model for Correspondence Pruning10harxivOptical-Guided Neural Collapse for SAR Few-Shot Class Incremental Learning10harxivDynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models10harxivTemporal Order Matters for Agentic Memory: Segment Trees for Long-Horizon Agents10hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗