arxiv
PublishedSeptember 18, 2026 at 4:00 AM
—neutral
Near-Optimal Pure Single-Loop Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization
Publisher summary· verbatim
arXiv:2609.20327v1 Announce Type: cross Abstract: We study smooth strongly convex--strongly concave minimax optimization with general nonlinear coupling in the deterministic unconstrained setting. We propose a pure single-loop damped extragradient method with fixed parameters and two new full-gradie
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSkillEarth: Teaching General-Purpose Agents to Act on Earth via Skill Evolution14marxivZero-Shot Weight-Space Programming for Prediction and Classification of Target Variables in Structured Datasets14marxivInformation Limits of Replay-Free Recurrent State Migration14marxivRegularizing Treatment Leakage for LLM-based Uplift Estimation14mThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗