Fetching the paper…
Reading the bibliography…
Optimistic Gradient Descent Ascent (OGDA) and Optimistic Multiplicative Weights Update (OMWU) for saddle-point optimization have received growing attention due to their favorable last-iterate convergence.
Zur theorie der gesellschaftsspiele
John von Neumann · 1928
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
A modification of the arrow-hurwicz method for search of saddle points
Leonid Denisovich Popov · 1980
Earlier work this paper cites.
Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications
Patrick T Harker and Jong-Shi Pang · 1990
Earlier work this paper cites.
Error bounds and convergence analysis of feasible descent methods: a general approach
Zhi-Quan Luo and Paul Tseng · 1993
Earlier work this paper cites.
A class of gap functions for variational inequalities
Torbjörn Larsson and Michael Patriksson · 1994
Earlier work this paper cites.
On linear convergence of iterative methods for the variational inequality problem
Paul Tseng · 1995
Earlier work this paper cites.
Error bounds in mathematical programming
Jong-Shi Pang · 1997
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Yoav Freund and Robert E Schapire · 1999
Earlier work this paper cites.
Some methods based on the d-gap function for solving monotone variational inequalities
Michael V Solodov and Paul Tseng · 2000
Earlier work this paper cites.
Convergence and no-regret in multiagent learning
Michael Bowling · 2005
Earlier work this paper cites.
First-order algorithm with o (ln (1/e)) convergence for e-equilibrium in two-person zero-sum games
Andrew Gilpin, Javier Peña, and Tuomas Sandholm · 2008
Earlier work this paper cites.
Metric subregularity and the proximal point method
D Leventhal · 2009
Earlier work this paper cites.
Online optimization with gradual variations
Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu · 2012
Earlier work this paper cites.
Optimization, learning, and games with predictable sequences
Sasha Rakhlin and Karthik Sridharan · 2013
Earlier work this paper cites.
Weiran Wang and Miguel A Carreira-Perpinán · 2013
Cited alongside, same era.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Cited alongside, same era.
Near-optimal no-regret algorithms for zero-sum games
Constantinos Daskalakis, Alan Deckelbaum, Anthony Kim, et al · 2015
Cited alongside, same era.
Error bounds and metric subregularity
Alexander Y Kruger · 2015
Cited alongside, same era.
Projected reflected gradient methods for monotone variational inequalities
Yu Malitsky · 2015
Cited alongside, same era.
Fast convergence of regularized learning in games
Vasilis Syrgkanis, Alekh Agarwal, Haipeng Luo, and Robert E Schapire · 2015
Vortices instead of equilibria in minmax optimization: Chaos and butterfly effects of online learning in zero-sum games
Yun Kuen Cheung and Georgios Piliouras · 2019
Later among the works it cites.
Last-iterate convergence: Zero-sum games and constrained min-max optimization
Constantinos Daskalakis and Ioannis Panageas · 2019
Later among the works it cites.
A variational inequality perspective on generative adversarial networks
Gauthier Gidel, Hugo Berard, Gaëtan Vignoud, Pascal Vincent, and Simon Lacoste-Julien · 2019
Later among the works it cites.
On the convergence of single-call stochastic extra-gradient methods
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2019
Later among the works it cites.
A new randomized block-coordinate primal-dual proximal algorithm for distributed optimization
Puya Latafat, Nikolaos M Freris, and Panagiotis Patrinos · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
On the analysis of reflected gradient and splitting methods for monotone stochastic variational inequality problems
Shisheng Cui and Uday V Shanbhag · 2016
Cited alongside, same era.
Convergence rates with inexact non-expansive operators
Jingwei Liang, Jalal Fadili, and Gabriel Peyré · 2016
Cited alongside, same era.
Accelerated schemes for a class of variational inequalities
Yunmei Chen, Guanghui Lan, and Yuyuan Ouyang · 2017
Cited alongside, same era.
Extragradient method with variance reduction for stochastic variational inequalities
Alfredo N Iusem, Alejandro Jofré, Roberto Imbuzeiro Oliveira, and Philip Thompson · 2017
Cited alongside, same era.
Multiplicative weights update in zero-sum games
James P Bailey and Georgios Piliouras · 2018
Cited alongside, same era.
The limit points of (optimistic) gradient descent in min-max optimization
Constantinos Daskalakis and Ioannis Panageas · 2018
Cited alongside, same era.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
Tengyuan Liang and James Stokes · 2019
Later among the works it cites.
Golden ratio algorithms for variational inequalities
Yura Malitsky · 2019
Later among the works it cites.
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
Panayotis Mertikopoulos, Houssam Zenati, Bruno Lecouat, Chuan-Sheng Foo, Vijay Chandrasekhar, and Georgios Piliouras · 2019
Later among the works it cites.
On lower iteration complexity bounds for the saddle point problems
Junyu Zhang, Mingyi Hong, and Shuzhong Zhang · 2019
Later among the works it cites.
A tight and unified analysis of gradient-based methods for a whole spectrum of differentiable games
Waïss Azizian, Ioannis Mitliagkas, Simon Lacoste-Julien, and Gauthier Gidel · 2020
Closest in time.
Chaos, extremism and optimism: Volume analysis of learning in games
Yun Kuen Cheung and Georgios Piliouras · 2020
Closest in time.
Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2020
Closest in time.
Near-optimal algorithms for minimax optimization
Tianyi Lin, Chi Jin, Michael Jordan, et al · 2020
Closest in time.
Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
Qi Lei, Sai Ganesh Nagarajan, Ioannis Panageas, and Xiao Wang · 2021
Closest in time.