Accelerating Min-Max Optimization via Power-Law Stepsizes
This work provides a deterministic dynamic stepsize schedule that accelerates the convergence rate of EG to $\mathcal{O}(T^{-2/3+\varepsilon})$ for any $\varepsilon>0$ and shows that this rate is nearly tight when the extrapolation and update steps of EG use the same stepsize.