Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems
COLT, pp. 1758-1784, 2020.
In this paper we study the smooth convex-concave saddle point problem
In this paper we study the smooth convex-concave saddle point problem. Specifically, we analyze the last iterate convergence properties of the Extragradient (EG) algorithm. It is well known that the ergodic (averaged) iterates of EG converge at a rate of $O(1/T)$ (Nemirovski, 2004). In this paper, we show that the last iterate of EG con...More
PPT (Upload PPT)