Corpus ID: 211011003

# Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems

@article{Golowich2020LastII,
title={Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems},
author={Noah Golowich and S. Pattathil and C. Daskalakis and A. Ozdaglar},
journal={ArXiv},
year={2020},
volume={abs/2002.00057}
}
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 converges at a rate of $O(1/\sqrt{T})$. To the best of our knowledge, this is the first paper to provide a convergence rate guarantee for the last iterate of EG for… Expand