Indian Institute of Technology Kanpur; Currently at Google Research; Max Planck Institute for Intelligent Systems
Aniket Das, Bernhard Schölkopf, Michael Muehlebach
Minimax Optimization;Smooth Games;Nonconvex-Nonconcave Minimax Optimization;Sampling without Replacement;Random Reshuffling;Shuffle Once;Incremental Gradient;Gradient Descent Ascent;Proximal Point Method;Alternating Gradient Descent Ascent
Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization