Fetching the paper…
Reading the bibliography…
This paper focuses on the distributed optimization of stochastic saddle point problems.
Minimax Estimates of the Mean of a Normal Distribution with Known Variance
J. Wolfowitz · 1950
Earlier work this paper cites.
Monotone (nonlinear) operators in Hilbert space
G. J. Minty · 1962
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
A distributed algorithm for minimum-weight spanning trees
R. G. Gallager, P. A. Humblet, and P. M. Spira · 1983
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovskij and D. B. Yudin · 1983
Earlier work this paper cites.
A modified forward-backward splitting method for maximal monotone mappings
P. Tseng · 2000
Earlier work this paper cites.
Gossip-based computation of aggregate information
D. Kempe, A. Dobra, and J. Gehrke · 2003
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.
Randomized gossip algorithms
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah · 2006
Earlier work this paper cites.
Finite-Dimensional Variational Inequalities and Complementarity Problems
F. Facchinei and J. Pang · 2007
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Y. Nesterov · 2007
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm, 2008
A. Juditsky, A. S. Nemirovskii, and C. Tauvel · 2008
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
A. Nedic and A. Ozdaglar · 2009
Earlier work this paper cites.
A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
E. Esser, X. Zhang, and T. F. Chan · 2010
Earlier work this paper cites.
Distributed training strategies for the structured perceptron
R. McDonald, K. Hall, and G. Mann · 2010
Earlier work this paper cites.
Distributed training strategies for the structured perceptron
R. McDonald, K. Hall, and G. Mann · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Earlier work this paper cites.
Accelerated linear iterations for distributed averaging
J. Liu and A. S. Morse · 2011
Earlier work this paper cites.
Generative adversarial networks, 2014
I. J. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
D. P. Kingma and J. Ba · 2014
Earlier work this paper cites.
Conditional generative adversarial nets
M. Mirza and S. Osindero · 2014
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2014
Cited alongside, same era.
Understanding Machine Learning: From Theory to Algorithms
S. Shalev-Shwartz and S. Ben-David · 2014
Cited alongside, same era.
Distributionally robust logistic regression
S. Abadeh, P. M. Mohajerin Esfahani, and D. Kuhn · 2015
Cited alongside, same era.
Communication complexity of distributed convex learning and optimization
Y. Arjevani and O. Shamir · 2015
Cited alongside, same era.
Unsupervised representation learning with deep convolutional generative adversarial networks
On the convergence of single-call stochastic extra-gradient methods, 2019
Y.-G. Hsieh, F. Iutzeler, J. Malick, and P. Mertikopoulos · 2019
Later among the works it cites.
Advances and open problems in federated learning
P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. Bonawitz, Z. Charles, G. Cormode, R. Cummings, et al · 2019
Later among the works it cites.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
T. Liang and J. Stokes · 2019
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 · 2019
Later among the works it cites.
A decentralized proximal point-type method for saddle point problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Radford, L. Metz, and S. Chintala · 2015
Cited alongside, same era.
Nips 2016 tutorial: Generative adversarial networks
I. Goodfellow · 2016
Cited alongside, same era.
Federated learning: Strategies for improving communication efficiency
J. Konečnỳ, H. B. McMahan, F. X. Yu, P. Richtárik, A. T. Suresh, and D. Bacon · 2016
Cited alongside, same era.
C. Daskalakis, A. Ilyas, V. Syrgkanis, and H. Zeng · 2017
Cited alongside, same era.
Communication-Efficient Learning of Deep Networks from Decentralized Data
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y. Arcas · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié · 2017
Cited alongside, same era.
A variational inequality perspective on generative adversarial networks
G. Gidel, H. Berard, G. Vignoud, P. Vincent, and S. Lacoste-Julien · 2018
Cited alongside, same era.
W. Liu, A. Mokhtari, A. Ozdaglar, S. Pattathil, Z. Shen, and N. Zheng · 2019
Later among the works it cites.
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Y. Ouyang and Y. Xu · 2019
Later among the works it cites.
Pytorch: An imperative style, high-performance deep learning library
A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala · 2019
Later among the works it cites.
Unified optimal analysis of the (stochastic) gradient method
S. U. Stich · 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.
Efficiently solving MDPs with stochastic mirror descent
Y. Jin and A. Sidford · 2020
Closest in time.
A decentralized algorithm for large scale min-max problems
S. Mukherjee and M. Chakraborty · 2020
Closest in time.
Training gans with centripetal acceleration
W. Peng, Y.-H. Dai, H. Zhang, and L. Cheng · 2020
Closest in time.
Multi-consensus decentralized accelerated gradient descent
H. Ye, L. Luo, Z. Zhou, and T. Zhang · 2020
Closest in time.
Solving a class of non-convex min-max games using adaptive momentum methods
B. Barazandeh, D. A. Tarzanagh, and G. Michailidis · 2021
Closest in time.
Local stochastic gradient descent ascent: Convergence analysis and communication efficiency
Y. Deng and M. Mahdavi · 2021
Closest in time.
Efficient methods for structured nonconvex-nonconcave min-max optimization
J. Diakonikolas, C. Daskalakis, and M. Jordan · 2021
Closest in time.
Efficient algorithms for federated saddle point optimization
C. Hou, K. K. Thekumparampil, G. Fanti, and S. Oh · 2021
Closest in time.
Decentralized distributed optimization for saddle point problems
A. Rogozin, A. Beznosikov, D. Dvinskikh, D. Kovalev, P. Dvurechensky, and A. Gasnikov · 2021
Closest in time.
Optimal gradient tracking for decentralized optimization
Z. Song, L. Shi, S. Pu, and M. Yan · 2021
Closest in time.