DS-OGDA is a single-loop first-order method claimed to handle a broad class of smooth minimax problems with a universal step-size schedule and best-known iteration complexity in each subclass.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems
DS-OGDA is a single-loop first-order method claimed to handle a broad class of smooth minimax problems with a universal step-size schedule and best-known iteration complexity in each subclass.