Fetching the paper…
Reading the bibliography…
We present a new family of min-max optimization algorithms that automatically exploit the geometry of the gradient data observed at earlier iterations to perform more informative extra-gradient steps in later ones.
Zur Theorie der Gesellschaftsspiele
John von Neumann · 1928
Earlier work this paper cites.
A social equilibrium existence theorem
Gérard Debreu · 1952
Earlier work this paper cites.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
Lev M. Bregman · 1967
Earlier work this paper cites.
Convex Analysis
Ralph Tyrrell Rockafellar · 1970
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.
Introduction to Optimization
Boris Teodorovich Polyak · 1987
Earlier work this paper cites.
Data Networks
Dimitri P. Bertsekas and Robert Gallager · 1992
Earlier work this paper cites.
Information-based complexity of linear operator equations
Arkadi Semen Nemirovski · 1992
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using Bregman functions
Gong Chen and Marc Teboulle · 1993
Earlier work this paper cites.
Quasi-Fejérian analysis of some optimization algorithms
Patrick L. Combettes · 2001
Earlier work this paper cites.
Fundamentals of Convex Analysis
Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal · 2001
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle · 2003
Earlier work this paper cites.
Finite-Dimensional Variational Inequalities and Complementarity Problems
Francisco Facchinei and Jong-Shi Pang · 2003
Earlier work this paper cites.
Generalized Nash equilibrium problems
Francisco Facchinei and Christian Kanzow · 2007
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Yurii Nesterov · 2007
Earlier work this paper cites.
Algorithmic Game Theory
Noam Nisan, Tim Roughgarden, Éva Tardos, and V. V. Vazirani (eds.) · 2007
Earlier work this paper cites.
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou · 2009
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
Arkadi Semen Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Cited alongside, same era.
Primal-dual subgradient methods for convex problems
Yurii Nesterov · 2009
Cited alongside, same era.
Convex optimization, game theory, and variational inequality theory in multiuser communication systems
Gesualdo Scutari, Francisco Facchinei, Daniel Pérez Palomar, and Jong-Shi Pang · 2010
Cited alongside, same era.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Semen Nemirovski, and Claire Tauvel · 2011
Cited alongside, same era.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2011
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2018
Later among the works it cites.
Cycles in adversarial regularized learning
Panayotis Mertikopoulos, Christos H. Papadimitriou, and Georgios Piliouras · 2018
Later among the works it cites.
Generalized mirror prox for monotone variational inequalities: Universality and inexact oracle
Fedor Stonyakin, Alexander Gasnikov, Pavel Dvurechensky, Mohammad Alkousa, and Alexander Titov · 2018
Later among the works it cites.
An adaptive mirror-prox algorithm for variational inequalities with singular operators
Kimon Antonakopoulos, E. Veronica Belmega, and Panayotis Mertikopoulos · 2019
Later among the works it cites.
A universal algorithm for variational inequalities adaptive to smoothness and noise
Francis Bach and Kfir Yehuda Levy · 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.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Cited alongside, same era.
Generative adversarial nets
Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Cited alongside, same era.
Optimization despite chaos: Convex relaxations to complex limit sets via Poincaré recurrence
Georgios Piliouras and Jeff S. Shamma · 2014
Cited alongside, same era.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Cited alongside, same era.
Projected reflected gradient methods for monotone variational inequalities
Yura Malitsky · 2015
Cited alongside, same era.
A descent lemma beyond Lipschitz gradient continuity: First-order methods revisited and applications
Heinz H. Bauschke, Jérôme Bolte, and Marc Teboulle · 2017
Cited alongside, same era.
Reducing noise in GAN training with variance reduced extragradient
Tatjana Chavdarova, Gauthier Gidel, François Fleuret, and Simon Lacoste-Julien · 2019
Later among the works it cites.
Poincaré recurrence, cycles and spurious equilibria in gradient-descent-ascent for non-convex non-concave zero-sum games
Lampros Flokas, Emmanouil Vasileios Vlatakis-Gkaragkounis, and Georgios Piliouras · 2019
Later among the works it cites.
An adaptive proximal method for variational inequalities
A.V. Gasnikov, P.E. Dvurechensky, F.S. Stonyakin, and A.A. Titov · 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.
Mathematical Foundations of Game Theory
Rida Laraki, Jérôme Renault, and Sylvain Sorin · 2019
Later among the works it cites.
Golden ratio algorithms for variational inequalities
Yura Malitsky · 2019
Later among the works it cites.
Learning in games with continuous action sets and unknown payoff functions
Panayotis Mertikopoulos and Zhengyuan Zhou · 2019
Later among the works it cites.
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati, Chuan-Sheng Foo, Vijay Chandrasekhar, and Georgios Piliouras · 2019
Later among the works it cites.
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Yuyuan Ouyang and Yangyang Xu · 2019
Later among the works it cites.
Inexact model: A framework for optimization and variational inequalities
Fedor Stonyakin, Alexander Gasnikov, Alexander Tyurin, Dmitry Pasechnyuk, Artem Agafonov, Pavel Dvurechensky, Darina Dvinskikh, Alexey Kroshnin, and Victorya Piskunova · 2019
Later among the works it cites.
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2020
Closest in time.