Fetching the paper…
Reading the bibliography…
Large scale convex-concave minimax problems arise in numerous applications, including game theory, robust training, and training of generative adversarial networks.
Zur theorie der gesellschaftsspiele
J. v. Neumann · 1928
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
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.
Imagenet: A large-scale hierarchical image database
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2010
Earlier work this paper cites.
Distributionally robust optimization under moment uncertainty with application to data-driven problems
E. Delage and Y. Ye · 2010
Earlier work this paper cites.
An architecture for parallel topic models
A. Smola and S. Narayanamurthy · 2010
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2011
Earlier work this paper cites.
First order methods for nonsmooth convex large-scale optimization, ii: utilizing problems structure
A. Juditsky, A. Nemirovski, et al · 2011
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
A. Juditsky, A. Nemirovski, and C. Tauvel · 2011
Earlier work this paper cites.
Complexity of variants of tseng’s modified f-b splitting and korpelevich’s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems
R. D. C. Monteiro and B. F. Svaiter · 2011
Earlier work this paper cites.
Superconcentration and Related Topics
S. Chatterjee · 2014
Earlier work this paper cites.
Optimal primal-dual methods for a class of saddle point problems
Y. Chen, G. Lan, and Y. Ouyang · 2014
Earlier work this paper cites.
Generative adversarial nets
I. J. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. C. Courville, and Y. Bengio · 2014
Earlier work this paper cites.
Towards principled methods for training generative adversarial networks
M. Arjovsky and L. Bottou · 2017
Earlier work this paper cites.
Wasserstein generative adversarial networks
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Earlier work this paper cites.
Accelerated schemes for a class of variational inequalities
Y. Chen, G. Lan, and Y. Ouyang · 2017
Earlier work this paper cites.
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
Earlier work this paper cites.
Adam: A method for stochastic optimization
D. P. Kingma and J. Ba · 2017
Earlier work this paper cites.
Training GANs with optimism
C. Daskalakis, A. Ilyas, V. Syrgkanis, and H. Zeng · 2018
Cited alongside, same era.
Cycles in adversarial regularized learning
P. Mertikopoulos, C. Papadimitriou, and G. Piliouras · 2018
Cited alongside, same era.
On the convergence of adam and beyond
S. J. Reddi, S. Kale, and S. Kumar · 2018
Cited alongside, same era.
A universal algorithm for variational inequalities adaptive to smoothness and noise
F. Bach and K. Y. Levy · 2019
Cited alongside, same era.
Large scale gan training for high fidelity natural image synthesis
A. Brock, J. Donahue, and K. Simonyan · 2019
Cited alongside, same era.
On the convergence of a class of adam-type algorithms for non-convex optimization
X. Chen, S. Liu, R. Sun, and M. Hong · 2019
Cited alongside, same era.
Communication-efficient distributed stochastic auc maximization with deep neural networks
Z. Guo, M. Liu, Z. Yuan, L. Shen, W. Liu, and T. Yang · 2020
Later among the works it cites.
On the convergence of fedavg on non-iid data
X. Li, K. Huang, W. Yang, S. Wang, and Z. Zhang · 2020
Later among the works it cites.
Near-optimal algorithms for minimax optimization
T. Lin, C. Jin, and M. I. Jordan · 2020
Later among the works it cites.
Don’t use large mini-batches, use local sgd
T. Lin, S. U. Stich, K. K. Patel, and M. Jaggi · 2020
Later among the works it cites.
Towards better understanding of adaptive gradient algorithms in generative adversarial nets
M. Liu, Y. Mroueh, J. Ross, W. Zhang, X. Cui, P. Das, and T. Yang · 2020
Later among the works it cites.
A decentralized parallel algorithm for training generative adversarial nets
M. Liu, W. Zhang, Y. Mroueh, X. Cui, J. Ross, T. Yang, and P. Das · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Universal stagewise learning for non-convex problems with convergence on averaged solutions
Z. Chen, Z. Yuan, J. Yi, B. Zhou, E. Chen, and T. Yang · 2019
Cited alongside, same era.
A variational inequality perspective on generative adversarial networks
G. Gidel, H. Berard, G. Vignoud, P. Vincent, and S. Lacoste-Julien · 2019
Cited alongside, same era.
Negative momentum for improved game dynamics
G. Gidel, R. A. Hemmat, M. Pezeshki, R. Le Priol, G. Huang, S. Lacoste-Julien, and I. Mitliagkas · 2019
Cited alongside, same era.
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
Cited alongside, same era.
Local SGD converges fast and communicates little
S. U. Stich · 2019
Cited alongside, same era.
Towards a unified min-max framework for adversarial exploration and robustness
J. Wang, T. Zhang, S. Liu, P.-Y. Chen, J. Xu, M. Fardad, and B. Li · 2019
Cited alongside, same era.
Later among the works it cites.
Y. Yan and Y. Xu · 2020
Later among the works it cites.
A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems
J. Zhang, P. Xiao, R. Sun, and Z. Luo · 2020
Later among the works it cites.
Adaptive extra-gradient methods for min-max optimization and games
K. Antonakopoulos, V. Belmega, and P. Mertikopoulos · 2021
Closest in time.
Distributed saddle-point problems: Lower bounds, optimal algorithms and federated gans
A. Beznosikov, V. Samokhin, and A. Gasnikov · 2021
Closest in time.
Quantized adam with error feedback
C. Chen, L. Shen, H. Huang, and W. Liu · 2021
Closest in time.
Towards practical adam: Non-convexity, convergence theory, and mini-batch acceleration
C. Chen, L. Shen, F. Zou, and W. Liu · 2021
Closest in time.
Cada: Communication-adaptive distributed adam
T. Chen, Z. Guo, Y. Sun, and W. Yin · 2021
Closest in time.
Local stochastic gradient descent ascent: Convergence analysis and communication efficiency
Y. Deng and M. Mahdavi · 2021
Closest in time.
Efficient algorithms for federated saddle point optimization, 2021
C. Hou, K. K. Thekumparampil, G. Fanti, and S. Oh · 2021
Closest in time.
Advances and open problems in federated learning
H. B. McMahan et al · 2021
Closest in time.
Adaptive federated optimization
S. J. Reddi, Z. Charles, M. Zaheer, Z. Garrett, K. Rush, J. Konečný, S. Kumar, and H. B. McMahan · 2021
Closest in time.
Decentralized distributed optimization for saddle point problems, 2021
A. Rogozin, A. Beznosikov, D. Dvinskikh, D. Kovalev, P. Dvurechensky, and A. Gasnikov · 2021
Closest in time.
Accelerated stochastic algorithms for convex-concave saddle-point problems
R. Zhao · 2021
Closest in time.