SEG-FFA achieves O~(1/K^{1/3}) convergence in convex-concave and O~(1/nK^4) in strongly-convex-strongly-concave finite-sum minimax problems, with lower bounds showing the gain over SGDA/SEG with random reshuffling.
Bauschke and Patrick L
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements
SEG-FFA achieves O~(1/K^{1/3}) convergence in convex-concave and O~(1/nK^4) in strongly-convex-strongly-concave finite-sum minimax problems, with lower bounds showing the gain over SGDA/SEG with random reshuffling.