Fetching the paper…
Reading the bibliography…
Smooth game optimization has recently attracted great interest in machine learning as it generalizes the single-objective optimization paradigm.
Theory of games and economic behavior
J Von Neumann and O Morgenstern · 1944
Earlier work this paper cites.
Methods of conjugate gradients for solving linear systems
Magnus R Hestenes, Eduard Stiefel, et al · 1952
Earlier work this paper cites.
Solution of systems of linear equations by minimized iterations
Cornelius Lanczos · 1952
Earlier work this paper cites.
Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order richardson iterative methods
Gene H Golub and Richard S Varga · 1961
Earlier work this paper cites.
Further results on polynomials having least maximum modulus over an ellipse in the complex plane
Ao J Clayton · 1963
Earlier work this paper cites.
Accelerating the jacobi method for solving simultaneous equations by chebyshev extrapolation when the eigenvalues of the iteration matrix are complex
HE Wrigley · 1963
Earlier work this paper cites.
The elements of real analysis , volume 2
Robert Gardner Bartle · 1964
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
Boris T Polyak · 1964
Earlier work this paper cites.
Chebyshev polynomials in numerical analysis
Leslie Fox and Ian Bax Parker · 1968
Earlier work this paper cites.
Faber polynomials and the faber series
JH Curtiss · 1971
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
The tchebychev iteration for nonsymmetric linear systems
Thomas A Manteuffel · 1977
Earlier work this paper cites.
On the construction of semi-iterative methods
Michael Eiermann and Wilhelm Niethammer · 1983
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate o (1/kˆ 2)
Yurii E Nesterov · 1983
Earlier work this paper cites.
The analysis ofk-step iterative methods for linear systems from summability theory
Wilhelm Niethammer and Richard S Varga · 1983
Earlier work this paper cites.
A study of semiiterative methods for nonsymmetric systems of linear equations
Michael Eiermann, Wilhelm Niethammer, and Richard S Varga · 1985
Earlier work this paper cites.
Introduction to optimization. optimization software
Boris T Polyak · 1987
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.
Convergence of Iterations for Linear Equations
Olavi Nevanlinna · 1993
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
Cited alongside, same era.
Chebyshev polynomials
John C Mason and David C Handscomb · 2002
Cited alongside, same era.
Optimality and stability in non-convex-non-concave min-max optimization
Guojun Zhang, Pascal Poupart, and Yaoliang Yu · 2002
Cited alongside, same era.
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
Cited alongside, same era.
Solving strongly monotone variational and quasi-variational inequalities
Yurii Nesterov and Laura Scrimali · 2006
Cited alongside, same era.
Discrete dynamical systems
Training gans with optimism
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2018
Later among the works it cites.
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.
Local saddle point optimization: A curvature exploitation approach
Leonard Adolphs, Hadi Daneshmand, Aurelien Lucchi, and Thomas Hofmann · 2019
Later among the works it cites.
Complex analysis: The argument principle in analysis and topology
Alan F Beardon · 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.
Linear lower bounds and conditioning of differentiable games
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Oded Galor · 2007
Cited alongside, same era.
Dual extrapolation and its applications to solving variational inequalities and related problems
Yurii Nesterov · 2007
Cited alongside, same era.
A unified analysis of first-order methods for smooth games via integral quadratic constraints
Guodong Zhang, Xuchao Bao, Laurent Lessard, and Roger Grosse · 2009
Cited alongside, same era.
Polynomial based iteration methods for symmetric linear systems
Bernd Fischer · 2011
Cited alongside, same era.
Matrix analysis
Roger A Horn and Charles R Johnson · 2012
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.
Nonlinear systems
Peter J Olver · 2015
Cited alongside, same era.
Adam Ibrahim, Waïss Azizian, Gauthier Gidel, and Ioannis Mitliagkas · 2019
Later among the works it cites.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael I Jordan · 2019
Later among the works it cites.
Differentiable game mechanics
Alistair Letcher, David Balduzzi, Sébastien Racaniere, James Martens, Jakob N 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.
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.
On solving minimax optimization locally: A follow-the-ridge approach
Yuanhao Wang, Guodong Zhang, and Jimmy Ba · 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.
An optimal multistage stochastic gradient method for minimax problems
Alireza Fallah, Asuman Ozdaglar, and Sarath Pattathil · 2020
Closest in time.
Gans may have no nash equilibria
Farzan Farnia and Asuman Ozdaglar · 2020
Closest in time.
Near-optimal algorithms for minimax optimization
Tianyi Lin, Chi Jin, Michael Jordan, et al · 2020
Closest in time.
A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach
Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil · 2020
Closest in time.
Average-case acceleration through spectral density estimation
Fabian Pedregosa and Damien Scieur · 2020
Closest in time.
Universal average-case optimality of polyak momentum
Damien Scieur and Fabian Pedregosa · 2020
Closest in time.
Improved algorithms for convex-concave minimax optimization
Yuanhao Wang and Jian Li · 2020
Closest in time.