Fetching the paper…
Reading the bibliography…
Min-max formulations have attracted great attention in the ML community due to the rise of deep generative models and adversarial methods, while understanding the dynamics of gradient algorithms for solving such formulations has remained a grand challenge.
A. Mokhtari, A. Ozdaglar, and S. Pattathil · 1901
Earlier work this paper cites.
A. Mokhtari, A. Ozdaglar, and S. Pattathil · 1906
Earlier work this paper cites.
Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind
I. Schur · 1917
Earlier work this paper cites.
On the solution of linear simultaneous equations by iteration
P. Stein and R. L. Rosenberg · 1948
Earlier work this paper cites.
Studies in linear and non-linear programming
K. J. Arrow, L. Hurwicz, and H. Uzawa · 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.
Régularisation d’inéquations variationnelles par approximations successives
B. Martinet · 1970
Earlier work this paper cites.
On linear convergence of iterative methods for the variational inequality problem
P. Tseng · 1970
Earlier work this paper cites.
Numerical methods for finding saddle points
V. F. Dem’yanov and A. B. Pevnyi · 1972
Earlier work this paper cites.
A generalized gradient method for finding saddlepoints
E. G. Gol’shtein · 1972
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R. T. Rockafellar · 1976
Earlier work this paper cites.
On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
R. E. Bruck · 1977
Earlier work this paper cites.
Une méthode itérative de résolution d’une inéquation variationnelle
P. L. Lions · 1978
Earlier work this paper cites.
Cesàro convergence of the gradient method of approximating saddle points of convex-concave functions
A. S. Nemirovski and D. B. Yudin · 1978
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.
Matrix polynomials
I. Gohberg, P. Lancaster, and L. Rodman · 1982
Cited alongside, same era.
Problem complexity and method efficiency in optimization
A. S. Nemirovski and D. B. Yudin · 1983
Cited alongside, same era.
A method for unconstrained convex minimization problem with the rate of convergence O ( 1 / k 2 ) {O}(1/k^{2})
Y. Nesterov · 1983
Cited alongside, same era.
Adaptive game playing using multiplicative weights
Y. Freund and R. E. Schapire · 1999
Cited alongside, same era.
Iterative methods for sparse linear systems
Y. Saad · 2003
Cited alongside, same era.
Prox-method with rate of convergence O ( 1 / t ) {O}(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
A. Nemirovski · 2004
The numerics of GANs
L. Mescheder, S. Nowozin, and A. Geiger · 2017
Later among the works it cites.
Gradient descent GAN optimization is locally stable
V. Nagarajan and J. Z. Kolter · 2017
Later among the works it cites.
Multiplicative weights update in zero-sum games
J. P. Bailey and G. Piliouras · 2018
Later among the works it cites.
Sbeed: Convergent reinforcement learning with nonlinear function approximation
B. Dai, A. Shaw, L. Li, L. Xiao, N. He, Z. Liu, J. Chen, and L. Song · 2018
Later among the works it cites.
Training GANs with optimism
C. Daskalakis, A. Ilyas, V. Syrgkanis, and H. Zeng · 2018
Later among the works it cites.
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Exact stability regions for quartic polynomials
S. S. Cheng and S. S. Chiou · 2007
Cited alongside, same era.
Settling the complexity of computing two-player Nash equilibria
X. Chen, X. Deng, and S.-H. Teng · 2009
Cited alongside, same era.
Subgradient methods for saddle-point problems
A. Nedić and A. Ozdaglar · 2009
Cited alongside, same era.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
R. D. C. Monteiro and B. F. Svaiter · 2010
Cited alongside, same era.
Discrete-time and sampled-data stability tests
M. Mansour · 2011
Cited alongside, same era.
Generative adversarial nets
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2014
Cited alongside, same era.
Cycles in adversarial regularized learning
P. Mertikopoulos, C. Papadimitriou, and G. Piliouras · 2018
Later among the works it cites.
Which training methods for GANs do actually converge?
L. Mescheder, A. Geiger, and S. Nowozin · 2018
Later among the works it cites.
Finite regret and cycles with fixed step-size via alternating gradient descent-ascent
J. P. Bailey, G. Gidel, and G. Piliouras · 2019
Closest in time.
Variance reduction for matrix games
Y. Carmon, Y. Jin, A. Sidford, and K. Tian · 2019
Closest in time.
Last-iterate convergence: Zero-sum games and constrained min-max optimization
C. Daskalakis and I. Panageas · 2019
Closest in time.
On the convergence of single-call stochastic extra-gradient methods
Y.-G. Hsieh, F. Iutzeler, J. Malick, and P. Mertikopoulos · 2019
Closest in time.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
T. Liang and J. Stokes · 2019
Closest in time.
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
Closest in time.
Training GANs with centripetal acceleration
W. Peng, Y. Dai, H. Zhang, and L. Cheng · 2019
Closest in time.