Fetching the paper…
Reading the bibliography…
Convergence to a saddle point for convex-concave functions has been studied for decades, while recent years has seen a surge of interest in non-convex (zero-sum) smooth games, motivated by their recent wide applications.
Convergence of learning dynamics in Stackelberg games
T. Fiez, B. Chasnov, and L. J. Ratliff · 1906
Earlier work this paper cites.
Über potenzreihen, die im innern des einheitskreises beschränkt sind
I. Schur · 1917
Earlier work this paper cites.
Zur theorie der gesellschaftsspiele
J. von Neumann · 1928
Earlier work this paper cites.
Market structure and equilibrium
H. von Stackelberg · 1934
Earlier work this paper cites.
On a theorem of weyl concerning eigenvalues of linear transformations: II
K. Fan · 1950
Earlier work this paper cites.
Equilibrium points in n n -person games
J. F. Nash · 1950
Earlier work this paper cites.
Studies in linear and non-linear programming
K. Arrow, L. Hurwicz, and H. Uzawa · 1958
Earlier work this paper cites.
On general minimax theorems
M. Sion et al · 1958
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
B. T. Polyak · 1964
Earlier work this paper cites.
The Theory of Max-Min, with Applications
J. M. Danskin · 1966
Earlier work this paper cites.
On the solution of several minimax problems. I
V. F. Dem’yanov · 1966
Earlier work this paper cites.
Sufficient conditions for a local minimax
V. F. Dem’yanov · 1970
Earlier work this paper cites.
A generalized gradient method for finding saddlepoints
E. G. Golshtein · 1972
Earlier work this paper cites.
Second-order directional derivatives of a function of the maximum
V. F. Dem’yanov · 1973
Earlier work this paper cites.
Introduction to Minimax
V. F. Dem’yanov and V. N. Malozemov · 1974
Earlier work this paper cites.
The influence curve and its role in robust estimation
F. R. Hampel · 1974
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. Korpelevich · 1976
Earlier work this paper cites.
Inequalities: theory of majorization and its applications , volume 143
A. W. Marshall, I. Olkin, and B. C. Arnold · 1979
Earlier work this paper cites.
A modification of the Arrow–Hurwicz method for search of saddle points
L. D. Popov · 1980
Earlier work this paper cites.
Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
A. Ben-Tal and J. Zowe · 1982
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovsky and D. B. Yudin · 1983
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence o ( 1 / k 2 ) o(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
The analysis of k k -step iterative methods for linear systems from summability theory
W. Niethammer and R. S. Varga · 1983
Earlier work this paper cites.
Directional derivatives in nonsmooth optimization
A. Ben-Tal and J. Zowe · 1985
Earlier work this paper cites.
Some np-complete problems in quadratic and nonlinear programming
K. G. Murty and S. N. Kabadi · 1987
Cited alongside, same era.
Introduction to Optimization
B. Polyak · 1987
Cited alongside, same era.
The upper and lower second order directional derivatives of a sup-type function
H. Kawasaki · 1988
Cited alongside, same era.
Second order directional derivatives in parametric optimization problems
A. Seeger · 1988
Cited alongside, same era.
Optimization and Nonsmooth Analysis
F. H. Clarke · 1990
Cited alongside, same era.
A Generalized Second-Order Derivative in Nonsmooth Optimization
R. Cominetti and R. Correa · 1990
Cited alongside, same era.
Towards deep learning models resistant to adversarial attacks
A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu · 2018
Later among the works it cites.
Cycles in adversarial regularized learning
P. Mertikopoulos, C. Papadimitriou, and G. Piliouras · 2018
Later among the works it cites.
Certifying some distributional robustness with principled adversarial training
A. Sinha, H. Namkoong, and J. Duchi · 2018
Later among the works it cites.
Nonlinear acceleration of primal-dual algorithms
R. Bollapragada, D. Scieur, and A. d’Aspremont · 2019
Later among the works it cites.
Negative momentum for improved game dynamics
G. Gidel, R. A. Hemmat, M. Pezeshki, G. Huang, R. Lepriol, S. Lacoste-Julien, and I. Mitliagkas · 2019
Later among the works it cites.
On the convergence of single-call stochastic extra-gradient methods
Y.-G. Hsieh, F. Iutzeler, J. Malick, and P. Mertikopoulos · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Second order necessary optimality conditions for minimizing a sup-type function
H. Kawasaki · 1991
Cited alongside, same era.
Second-order necessary and sufficient optimality conditions for minimizing a sup-type function
H. Kawasaki · 1992
Cited alongside, same era.
Introduction to the modern theory of dynamical systems , volume 54
A. Katok and B. Hasselblatt · 1995
Cited alongside, same era.
Nonlinear programming
D. P. Bertsekas · 1997
Cited alongside, same era.
Introduction to reinforcement learning , volume 135
R. S. Sutton, A. G. Barto, et al · 1998
Cited alongside, same era.
Fundamentals of convex analysis
J.-B. Hiriart-Urruty and C. Lemaréchal · 2004
Cited alongside, same era.
Later among the works it cites.
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
P. Mertikopoulos, B. Lecouat, H. Zenati, C.-S. Foo, V. Chandrasekhar, and G. Piliouras · 2019
Later among the works it cites.
A. Mokhtari, A. Ozdaglar, and S. Pattathil · 2019
Later among the works it cites.
On Lower Iteration Complexity Bounds for the Saddle Point Problems
J. Zhang, M. Hong, and S. Zhang · 2019
Later among the works it cites.
Solving non-convex non-differentiable min-max games using proximal gradient method
B. Barazandeh and M. Razaviyayn · 2020
Closest in time.
A closer look at the optimization landscapes of generative adversarial networks
H. Berard, G. Gidel, A. Almahairi, P. Vincent, and S. Lacoste-Julien · 2020
Closest in time.
Do GANs always have Nash equilibria?
F. Farnia and A. Ozdaglar · 2020
Closest in time.
Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling
Y.-G. Hsieh, F. Iutzeler, J. Malick, and P. Mertikopoulos · 2020
Closest in time.
Linear lower bounds and conditioning of differentiable games
A. Ibrahim, W. Azizian, G. Gidel, and I. Mitliagkas · 2020
Closest in time.
What is local optimality in nonconvex-nonconcave minimax optimization?
C. Jin, P. Netrapalli, and M. Jordan · 2020
Closest in time.
Near-optimal algorithms for minimax optimization
T. Lin, C. Jin, and M. I. Jordan · 2020
Closest in time.
Min-max optimization without gradients: Convergence and applications to black-box evasion and poisoning attacks
S. Liu, S. Lu, X. Chen, Y. Feng, K. Xu, A. Al-Dujaili, M. Hong, and U.-M. O’Reilly · 2020
Closest in time.
Training GANs with centripetal acceleration
W. Peng, Y.-H. Dai, H. Zhang, and L. Cheng · 2020
Closest in time.
Nonconvex min-max optimization: Applications, challenges, and recent theoretical advances
M. Razaviyayn, T. Huang, S. Lu, M. Nouiehed, M. Sanjabi, and M. Hong · 2020
Closest in time.
Implicit competitive regularization in GANs
F. Schaefer, H. Zheng, and A. Anandkumar · 2020
Closest in time.
On solving minimax optimization locally: A follow-the-ridge approach
Y. Wang, G. Zhang, and J. Ba · 2020
Closest in time.
Convergence of gradient methods on bilinear zero-sum games
G. Zhang and Y. Yu · 2020
Closest in time.
Optimality and stability in non-convex smooth games
G. Zhang, P. Poupart, and Y. Yu · 2020
Closest in time.