Fetching the paper…
Reading the bibliography…
The theory of integral quadratic constraints (IQCs) allows the certification of exponential convergence of interconnected systems containing nonlinear or uncertain elements.
Theory of games and economic behavior
J Von Neumann and O Morgenstern · 1944
Earlier work this paper cites.
On the schur complement
Emilie V Haynsworth · 1968
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
Galina M Korpelevich · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R Tyrrell Rockafellar · 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.
A method of solving a convex programming problem with convergence rate o(kˆ2)
Yurii Nesterov · 1983
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.
A linear matrix inequality approach to H ∞ \infty control
Pascal Gahinet and Pierre Apkarian · 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.
Convergence rates in forward–backward splitting
George HG Chen and R Tyrrell Rockafellar · 1997
Earlier work this paper cites.
System analysis via integral quadratic constraints
Alexandre Megretski and Anders Rantzer · 1997
Earlier work this paper cites.
Macaulay2, a software system for research in algebraic geometry, 2002
Daniel R Grayson and Michael E Stillman · 2002
Earlier work this paper cites.
Convex optimization
Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Discrete-time Markov jump linear systems
Oswaldo Luiz Valle Costa, Marcelo Dutra Fragoso, and Ricardo Paulino Marques · 2006
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.
On accelerated proximal gradient methods for convex-concave optimization
Paul Tseng · 2008
Earlier work this paper cites.
A randomized kaczmarz algorithm with exponential convergence
Thomas Strohmer and Roman Vershynin · 2009
Earlier work this paper cites.
Dualities in convex algebraic geometry
Philipp Rostalski and Bernd Sturmfels · 2010
Earlier work this paper cites.
Non-asymptotic analysis of stochastic approximation algorithms for machine learning
Eric Moulines and Francis R Bach · 2011
Earlier work this paper cites.
Imagenet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever, and Geoffrey E Hinton · 2012
Earlier work this paper cites.
Non-strongly-convex smooth stochastic approximation with convergence rate o (1/n)
Francis Bach and Eric Moulines · 2013
Earlier work this paper cites.
Optimization, learning, and games with predictable sequences
Sasha Rakhlin and Karthik Sridharan · 2013
Earlier work this paper cites.
Fast convergence of stochastic gradient descent under a strong growth condition
Mark Schmidt and Nicolas Le Roux · 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.
Proximal algorithms
Neal Parikh and Stephen Boyd · 2014
Cited alongside, same era.
Global convergence of the heavy-ball method for convex optimization
Euhanna Ghadimi, Hamid Reza Feyzmahdavian, and Mikael Johansson · 2015
Cited alongside, same era.
Unsupervised representation learning with deep convolutional generative adversarial networks
Alec Radford, Luke Metz, and Soumith Chintala · 2015
Cited alongside, same era.
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.
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 · 2018
Later among the works it cites.
Last-iterate convergence rates for min-max optimization
Jacob Abernethy, Kevin A Lai, and Andre Wibisono · 2019
Later among the works it cites.
Local saddle point optimization: A curvature exploitation approach
Leonard Adolphs, Hadi Daneshmand, Aurelien Lucchi, and Thomas Hofmann · 2019
Later among the works it cites.
Convergence of learning dynamics in stackelberg games
Tanner Fiez, Benjamin Chasnov, and Lillian J Ratliff · 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…
Steven Diamond and Stephen Boyd · 2016
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan · 2016
Cited alongside, same era.
Analysis and design of optimization algorithms via integral quadratic constraints
Laurent Lessard, Benjamin Recht, and Andrew Packard · 2016
Cited alongside, same era.
Primer on monotone operator methods
Ernest K Ryu and Stephen Boyd · 2016
Cited alongside, same era.
Wasserstein generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
The proximal point method revisited
Dmitriy Drusvyatskiy · 2017
Cited alongside, same era.
Stochastic variance reduction methods for policy evaluation
Simon S Du, Jianshu Chen, Lihong Li, Lin Xiao, and Dengyong Zhou · 2017
Cited alongside, same era.
Negative momentum for improved game dynamics
Gauthier Gidel, Reyhane Askari Hemmat, Mohammad Pezeshki, Rémi Le Priol, Gabriel Huang, Simon Lacoste-Julien, and Ioannis Mitliagkas · 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.
Differentiable game mechanics
Alistair Letcher, David Balduzzi, Sébastien Racaniere, James Martens, Jakob Foerster, Karl Tuyls, and Thore Graepel · 2019
Later among the works it cites.
On finding local nash equilibria (and only local nash equilibria) in zero-sum games
Eric V Mazumdar, Michael I Jordan, and S Shankar Sastry · 2019
Later among the works it cites.
Competitive gradient descent
Florian Schäfer and Anima Anandkumar · 2019
Later among the works it cites.
Fast and faster convergence of sgd for over-parameterized models and an accelerated perceptron
Sharan Vaswani, Francis Bach, and Mark Schmidt · 2019
Later among the works it cites.
On solving minimax optimization locally: A follow-the-ridge approach
Yuanhao Wang, Guodong Zhang, and Jimmy Ba · 2019
Later among the works it cites.
From proximal point method to nesterov’s acceleration
Kwangjun Ahn · 2020
Closest in time.
An optimal multistage stochastic gradient method for minimax problems
Alireza Fallah, Asuman Ozdaglar, and Sarath Pattathil · 2020
Closest in time.
Do GANs always have Nash equilibria?
Farzan Farnia and Asuman Ozdaglar · 2020
Closest in time.
Lead: Least-action dynamics for min-max optimization
Reyhane Askari Hemmat, Amartya Mitra, Guillaume Lajoie, and Ioannis Mitliagkas · 2020
Closest in time.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael Jordan · 2020
Closest in time.
Direct synthesis of iterative algorithms with bounds on achievable worst-case convergence rate
Laurent Lessard and Peter Seiler · 2020
Closest in time.
A second-order equilibrium in nonconvex-nonconcave min-max optimization: Existence and algorithm
Oren Mangoubi and Nisheeth K Vishnoi · 2020
Closest in time.
Revisiting stochastic extragradient
Konstantin Mishchenko, Dmitry Kovalev, Egor Shulgin, Peter Richtárik, and Yura Malitsky · 2020
Closest in time.
Operator splitting performance estimation: Tight contraction factors and optimal parameter selection
Ernest K Ryu, Adrien B Taylor, Carolina Bergeling, and Pontus Giselsson · 2020
Closest in time.
On the suboptimality of negative momentum for minimax optimization
Guodong Zhang and Yuanhao Wang · 2021
Closest in time.