Fetching the paper…
Reading the bibliography…
We consider nonconvex-concave minimax problems, $\min_{\mathbf{x}} \max_{\mathbf{y} \in \mathcal{Y}} f(\mathbf{x}, \mathbf{y})$, where $f$ is nonconvex in $\mathbf{x}$ but concave in $\mathbf{y}$ and $\mathcal{Y}$ is a convex and bounded set.
A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach
A. Mokhtari, A. Ozdaglar, and S. Pattathil · 1901
Earlier work this paper cites.
Proximal point approximations achieving a convergence rate of o ( 1 / k ) o(1/k) for smooth convex-concave saddle point problems: Optimistic gradient and extra-gradient methods
A. Mokhtari, A. Ozdaglar, and S. Pattathil · 1906
Earlier work this paper cites.
Zur theorie der gesellschaftsspiele
J. V. Neumann · 1928
Earlier work this paper cites.
An iterative method of solving a game
J. Robinson · 1951
Earlier work this paper cites.
Solutions of saddle value problems by differential equations
T. Kose · 1956
Earlier work this paper cites.
On general minimax theorems
M. Sion · 1958
Earlier work this paper cites.
Iterative methods for concave programming
H. Uzawa · 1958
Earlier work this paper cites.
Generalized gradient method for finding saddle points
E. G. Golshtein · 1974
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
Convergence rates in forward–backward splitting
G. H. G. Chen and R. T. Rockafellar · 1997
Earlier work this paper cites.
Dynamic Noncooperative Game Theory , volume 23
T. Basar and G. J. Olsder · 1999
Earlier work this paper cites.
Mixed equilibria and dynamical systems arising from fictitious play in perturbed games
M. Benaım and M. W. Hirsch · 1999
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
A. Nemirovski · 2004
Earlier work this paper cites.
Prediction, Learning, and Games
N. Cesa-Bianchi and G. Lugosi · 2006
Earlier work this paper cites.
Algorithmic Game Theory
N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani · 2007
Earlier work this paper cites.
Theory of Games and Economic Behavior (Commemorative Edition)
J. Von Neumann and O. Morgenstern · 2007
Earlier work this paper cites.
Cooperative Control of Distributed Multi-agent Systems
J. Shamma · 2008
Earlier work this paper cites.
Subgradient methods for saddle-point problems
A. Nedić and A. Ozdaglar · 2009
Earlier work this paper cites.
Robustness and regularization of support vector machines
H. Xu, C. Caramanis, and S. Mannor · 2009
Cited alongside, same era.
Distributed sparse linear regression
G. Mateos, J. A. Bazerque, and G. B. Giannakis · 2010
Cited alongside, same era.
Solving variational inequalities with stochastic mirror-prox algorithm
A. Juditsky, A. Nemirovski, and C. Tauvel · 2011
Cited alongside, same era.
Multiple equilibria and limit cycles in evolutionary games with logit dynamics
C. H. Hommes and M. I. Ochea · 2012
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course , volume 87
Y. Nesterov · 2013
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.
An online learning approach to generative adversarial networks
P. Grnarova, K. Y. Levy, A. Lucchi, T. Hofmann, and A. Krause · 2018
Later among the works it cites.
Artificial intelligence–the revolution hasn’t happened yet
M. I. Jordan · 2018
Later among the works it cites.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
T. Liang and J. Stokes · 2018
Later among the works it cites.
Solving weakly-convex-weakly-concave saddle-point problems as weakly-monotone variational inequality
Q. Lin, M. Liu, H. Rafique, and T. Yang · 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.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Distributionally robust logistic regression
S. S. Abadeh, P. M. M. Esfahani, and D. Kuhn · 2015
Cited alongside, same era.
Convex Analysis
R. T. Rockafellar · 2015
Cited alongside, same era.
Stochastic gradient methods for distributionally robust optimization with f-divergences
H. Namkoong and J. C. Duchi · 2016
Cited alongside, same era.
Saddle-point dynamics: conditions for asymptotic stability of saddle points
A. Cherukuri, B. Gharesifard, and J. Cortes · 2017
Cited alongside, same era.
Training gans with optimism
C. Daskalakis, A. Ilyas, V. Syrgkanis, and H. Zeng · 2017
Cited alongside, same era.
GANs trained by a two time-scale update rule converge to a local nash equilibrium
M. Heusel, H. Ramsauer, T. Unterthiner, B. Nessler, and S. Hochreiter · 2017
Cited alongside, same era.
H. Rafique, M. Liu, Q. Lin, and T. Yang · 2018
Later among the works it cites.
On the convergence and robustness of training gans with regularized optimal transport
M. Sanjabi, J. Ba, M. Razaviyayn, and J. D. Lee · 2018
Later among the works it cites.
Certifiable distributional robustness with principled adversarial training
A. Sinha, H. Namkoong, and J. Duchi · 2018
Later among the works it cites.
A tight and unified analysis of extragradient for a whole spectrum of differentiable games
W. Azizian, I. Mitliagkas, S. Lacoste-Julien, and G. Gidel · 2019
Closest in time.
Stochastic model-based minimization of weakly convex functions
D. Davis and D. Drusvyatskiy · 2019
Closest in time.
Minmax optimization: Stable limit points of gradient descent ascent are locally optimal
C. Jin, P. Netrapalli, and M. I. Jordan · 2019
Closest in time.
An accelerated inexact proximal point method for solving nonconvex-concave min-max problems
W. Kong and R. D. C. Monteiro · 2019
Closest in time.
Hybrid block successive approximation for one-sided non-convex min-max problems: Algorithms and applications
S. Lu, I. Tsaknakis, M. Hong, and Y. Chen · 2019
Closest in time.
On finding local nash equilibria (and only local nash equilibria) in zero-sum games
E. V. Mazumdar, M. I. Jordan, and S. S. Sastry · 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.
Solving a class of non-convex min-max games using iterative first order methods
M. Nouiehed, M. Sanjabi, T. Huang, J. D. Lee, and M. Razaviyayn · 2019
Closest in time.
Efficient algorithms for smooth minimax optimization
K. K. Thekumparampil, P. Jain, P. Netrapalli, and S. Oh · 2019
Closest in time.