Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. An Optimal Multistage Stochastic Gradient Method for Minimax Problems

An Optimal Multistage Stochastic Gradient Method for Minimax Problems

Thumbnail Image
Download
Name

2002.05683.pdf

Description
Submitted version
Size

293.11 KB

Format

Adobe PDF

Checksum (MD5)

2c8cdf8e2d23547452c777a0bafd5bb4

sword-2022-07-18T16:56:10.original.xml (130 B)
Original SWORD entry document
Author(s)
Fallah, Alireza
•
Ozdaglar, Asuman
•
Pattathil, Sarath
Date Issued
2020
Journal
Proceedings of the IEEE Conference on Decision and Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Fallah, Alireza, Ozdaglar, Asuman and Pattathil, Sarath. 2020. "An Optimal Multistage Stochastic Gradient Method for Minimax Problems." Proceedings of the IEEE Conference on Decision and Control, 2020-December.
Version
Original manuscript
Abstract
© 2020 IEEE. In this paper, we study the minimax optimization problem in the smooth and strongly convex-strongly concave setting when we have access to noisy estimates of gradients. In particular, we first analyze the stochastic Gradient Descent Ascent (GDA) method with constant stepsize, and show that it converges to a neighborhood of the solution of the minimax problem. We further provide tight bounds on the convergence rate and the size of this neighborhood. Next, we propose a multistage variant of stochastic GDA (M-GDA) that runs in multiple stages with a particular learning rate decay schedule and converges to the exact solution of the minimax problem. We show M-GDA achieves the lower bounds in terms of noise dependence without any assumptions on the knowledge of noise characteristics. We also show that M-GDA obtains a linear decay rate with respect to the error's dependence on the initial error, although the dependence on condition number is suboptimal. In order to improve this dependence, we apply the multistage machinery to the stochastic Optimistic Gradient Descent Ascent (OGDA) algorithm and propose the M-OGDA algorithm which also achieves the optimal linear decay rate with respect to the initial error. To the best of our knowledge, this method is the first to simultaneously achieve the best dependence on noise characteristic as well as the initial error and condition number.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/143824
DOI of Published Version
https://doi.org/10.1109/CDC42340.2020.9304033
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.