Algorithms Seminar

Last-Iterate Convergence in Min-Max Optimization: SOS to the Rescue

October 26, -
Speaker(s): Yang Cai

Abstract

Min-max optimization is a classical problem in optimization and game theory and has recently played a central role in modern machine learning (ML) applications. These applications range from generative adversarial networks, adversarial examples, robust optimization, to multi-agent reinforcement learning. These ML applications present novel challenges to min-max optimization, necessitating that algorithms (i) demonstrate last-iterate convergence, in contrast to the more traditional average-iterate convergence, and (ii) be robust in nonconvex-nonconcave environments. In this talk, we first focus on the last-iterate convergence rates of two classical and widely-used algorithms for solving convex-concave min-max optimization – the extragradient (EG) method by Korpelevich (1976) and the optimistic gradient (OG) method by Popov (1980). Despite the considerable attention these algorithms have received from both the optimization and machine learning communities over the years, the last-iterate convergence rates for both algorithms remained open. We resolve this open problem by showing both EG and OG exhibit a tight O(1/\sqrt{T}) last-iterate convergence rate under arbitrary convex constraints. In the second part of the talk, we discuss some recent progress on designing optimal first-order methods for structured nonconvex-nonconcave min-max optimization. Our results are obtained via a new sum-of-squares (SOS) programming based approach, which may be useful in analyzing other iterative methods. The talk is based on joint work with Argyris Oikonomou and Weiqiang Zheng.

Speaker

Yang Cai is Associate Professor of Computer Science and Economics (secondary appointment) at Yale University. He is the Research Director for Computer Science at the Center for Algorithms, Data, & Market Design at Yale (CADMY) and a member of the Institute for Foundations of Data Science (FDS).

Location

LSRC D344 or join virtually via Zoom https://duke.zoom.us/j/92510717076

Contact

Yiheng Shen