Fetching the paper…
Reading the bibliography…
Differential games, in particular two-player sequential zero-sum games (a.k.a.
What is local optimality in nonconvex-nonconcave minimax optimization?
Jin, C., Netrapalli, P., and Jordan, M. I. (2020) · 1902
Earlier work this paper cites.
Equilibrium points in n-person games
Nash, J. F. (1950) · 1950
Earlier work this paper cites.
Theory of games and economic behavior
Morgenstern, O. and von Neumann, J. (1953) · 1953
Earlier work this paper cites.
Studies in linear and non-linear programming
Arrow, K., Hurwicz, L., and Uzawa, H. (1958) · 1958
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
Polyak, B. T. (1964) · 1964
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
Korpelevich, G. (1976) · 1976
Earlier work this paper cites.
A modification of the Arrow–Hurwicz method for search of saddle points
Popov, L. D. (1980) · 1980
Earlier work this paper cites.
Introduction to Optimization
Polyak, B. (1987) · 1987
Earlier work this paper cites.
Backpropagation: Past and future
Werbos, P. (1988) · 1988
Earlier work this paper cites.
Fast exact multiplication by the hessian
Pearlmutter, B. A. (1994) · 1994
Earlier work this paper cites.
Nonlinear programming
Bertsekas, D. P. (1997) · 1997
Earlier work this paper cites.
Matrix analysis and applied linear algebra
Meyer, C. D. (2000) · 2000
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Nesterov, Y. (2003) · 2003
Earlier work this paper cites.
Convex optimization
Boyd, S. and Vandenberghe, L. (2004) · 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
Nemirovski, A. (2004) · 2004
Earlier work this paper cites.
Reducing the dimensionality of data with neural networks
Hinton, G. E. and Salakhutdinov, R. R. (2006) · 2006
Earlier work this paper cites.
Stochastic Approximation: A Dynamical Systems Viewpoint
Borkar, V. S. (2008) · 2008
Cited alongside, same era.
Deep learning via Hessian-free optimization
Martens, J. (2010) · 2010
Cited alongside, same era.
Rmsprop: Divide the gradient by a running average of its recent magnitude
Hinton, G., Srivastava, N., and Swersky, K. (2012) · 2012
Cited alongside, same era.
Generative adversarial nets
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014) · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J. (2015) · 2015
Cited alongside, same era.
Singularity of the hessian in deep learning
Sagun, L., Bottou, L., and LeCun, Y. (2016) · 2016
Cited alongside, same era.
Towards deep learning models resistant to adversarial attacks
Madry, A., Makelov, A., Schmidt, L., Tsipras, D., and Vladu, A. (2018) · 2018
Later among the works it cites.
Spectral normalization for generative adversarial networks
Miyato, T., Kataoka, T., Koyama, M., and Yoshida, Y. (2018) · 2018
Later among the works it cites.
On the convergence of Adam and beyond
Reddi, S. J., Kale, S., and Kumar, S. (2018) · 2018
Later among the works it cites.
Certifiable distributional robustness with principled adversarial training
Sinha, A., Namkoong, H., and Duchi, J. (2018) · 2018
Later among the works it cites.
On the convergence of single-call stochastic extra-gradient methods
Hsieh, Y.-G., Iutzeler, F., Malick, J., and Mertikopoulos, P. (2019) · 2019
Later among the works it cites.
Optimistic mirror descent in saddle-point problems: Going the extra(-gradient) mile
Mertikopoulos, P., Lecouat, B., Zenati, H., Foo, C.-S., Chandrasekhar, V., and Piliouras, G. (2019) · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Wasserstein generative adversarial networks
Arjovsky, M., Chintala, S., and Bottou, L. (2017) · 2017
Cited alongside, same era.
Stochastic variance reduction methods for policy evaluation
Du, S. S., Chen, J., Li, L., Xiao, L., and Zhou, D. (2017) · 2017
Cited alongside, same era.
GANs trained by a two time-scale update rule converge to a local Nash equilibrium
Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., and Hochreiter, S. (2017) · 2017
Cited alongside, same era.
The numerics of GANs
Mescheder, L., Nowozin, S., and Geiger, A. (2017) · 2017
Cited alongside, same era.
Unrolled generative adversarial networks
Metz, L., Poole, B., Pfau, D., and Sohl-Dickstein, J. (2017) · 2017
Cited alongside, same era.
Gradient descent GAN optimization is locally stable
Nagarajan, V. and Kolter, J. Z. (2017) · 2017
Cited alongside, same era.
Later among the works it cites.
Agnostic Federated Learning
Mohri, M., Sivek, G., and Suresh, A. T. (2019) · 2019
Later among the works it cites.
Learning controllable fair representations
Song, J., Kalluri, P., Grover, A., Zhao, S., and Ermon, S. (2019) · 2019
Later among the works it cites.
Do GANs always have Nash equilibria?
Farnia, F. and Ozdaglar, A. (2020) · 2020
Closest in time.
Implicit Learning Dynamics in Stackelberg Games: Equilibria Characterization, Convergence Analysis, and Empirical Study
Fiez, T., Chasnov, B., and Ratliff, L. J. (2020) · 2020
Closest in time.
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
Royer, C. W., O’Neill, M., and Wright, S. J. (2020) · 2020
Closest in time.
On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach
Wang, Y., Zhang, G., and Ba, J. (2020) · 2020
Closest in time.
Convergence of gradient methods on bilinear zero-sum games
Zhang, G. and Yu, Y. (2020) · 2020
Closest in time.
Optimality and stability in non-convex smooth games
Zhang, G., Yu, Y., and Poupart, P. (2022) · 2022
Closest in time.
Domain-adversarial training of neural networks
Ganin, Y., Ustinova, E., Ajakan, H., Germain, P., Larochelle, H., Laviolette, F., Marchand, M., and Lempitsky, V. (2016) · 2030
Closest in time.