Fetching the paper…
Reading the bibliography…
Variational inequalities are a formalism that includes games, minimization, saddle point, and equilibrium problems as special cases.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate o (1/kˆ 2)
Yurii E Nesterov · 1983
Earlier work this paper cites.
A modified forward-backward splitting method for maximal monotone mappings
Paul Tseng · 2000
Earlier work this paper cites.
Finite-Dimensional Variational Inequalities and Complementarity Problems
Francisco Facchinei and Jong-Shi Pang · 2003
Earlier work this paper cites.
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
Arkadi Nemirovski · 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
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Distributed optimization in sensor networks
M. Rabbat and R. Nowak · 2004
Earlier work this paper cites.
Fast linear iterations for distributed averaging
Lin Xiao and Stephen Boyd · 2004
Earlier work this paper cites.
A support vector method for multivariate performance measures
Thorsten Joachims · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu Nesterov · 2005
Earlier work this paper cites.
Maximum margin clustering
Linli Xu, James Neufeld, Bryce Larson, and Dale Schuurmans · 2005
Earlier work this paper cites.
Randomized gossip algorithms
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah · 2006
Earlier work this paper cites.
Finite-Dimensional Variational Inequalities and Complementarity Problems
F. Facchinei and J.S. Pang · 2007
Earlier work this paper cites.
Convex sparse matrix factorizations
Francis Bach, Julien Mairal, and Jean Ponce · 2008
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm, 2008
Anatoli Juditsky, Arkadii S. Nemirovskii, and Claire Tauvel · 2008
Earlier work this paper cites.
Distributed spectrum sensing for cognitive radio networks by exploiting sparsity
Juan Andrés Bazerque and Georgios B Giannakis · 2009
Earlier work this paper cites.
Robust Optimization
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedić and Asuman Ozdaglar · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
Ernie Esser, Xiaoqun Zhang, and Tony F Chan · 2010
Earlier work this paper cites.
Optimization with sparsity-inducing penalties
Francis Bach, Rodolphe Jenatton, Julien Mairal, and Guillaume Obozinski · 2011
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
Antonin Chambolle and Thomas Pock · 2011
Earlier work this paper cites.
Libsvm: a library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Earlier work this paper cites.
Distributed min-max optimization in networks
Kunal Srivastava, Angelia Nedić, and Dušan Stipanović · 2011
Earlier work this paper cites.
Optimal decentralized protocol for electric vehicle charging
Lingwen Gan, Ufuk Topcu, and Steven H Low · 2012
Earlier work this paper cites.
Accelerated gradient methods and dual decomposition in distributed model predictive control
Pontus Giselsson, Minh Dang Doan, Tamás Keviczky, Bart De Schutter, and Anders Rantzer · 2013
Cited alongside, same era.
Mini-course on convex programming algorithms, 2013
Arkadi Nemirovski · 2013
Cited alongside, same era.
An o (1/k) gradient method for network resource allocation problems
Amir Beck, Angelia Nedić, Asuman Ozdaglar, and Marc Teboulle · 2014
Cited alongside, same era.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Cited alongside, same era.
Distributed subgradient methods for saddle-point problems
David Mateos-Núñez and Jorge Cortés · 2015
Cited alongside, same era.
Federated learning: strategies for improving communication efficiency
Jakub Konečný, H. Brendan McMahan, Felix Yu, Peter Richtárik, Ananda Theertha Suresh, and Dave Bacon · 2016
Freelb: Enhanced adversarial training for natural language understanding
Chen Zhu, Yu Cheng, Zhe Gan, Siqi Sun, Tom Goldstein, and Jingjing Liu · 2019
Later among the works it cites.
Distributed saddle-point problems: Lower bounds, optimal algorithms and federated GANs
Aleksandr Beznosikov, Valentin Samokhin, and Alexander Gasnikov · 2020
Later among the works it cites.
An optimal algorithm for decentralized finite sum optimization
Hadrien Hendrikx, Francis Bach, and Laurent Massoulie · 2020
Later among the works it cites.
Efficiently solving MDPs with stochastic mirror descent
Yujia Jin and Aaron Sidford · 2020
Later among the works it cites.
A unified theory of decentralized sgd with changing topology and local updates
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A geometrically convergent method for distributed optimization over time-varying graphs
Angelia Nedich, Alex Olshevsky, and Wei Shi · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis Bach · 2016
Cited alongside, same era.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Heinz Bauschke and Patrick Combettes · 2017
Cited alongside, same era.
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2017
Cited alongside, same era.
Communication-efficient learning of deep networks from decentralized data
H Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Agüera y Arcas · 2017
Cited alongside, same era.
Deep decentralized multi-task multi-agent reinforcement learning under partial observability
Shayegan Omidshafiei, Jason Pazis, Christopher Amato, Jonathan P. How, and John Vian · 2017
Cited alongside, same era.
Anastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi, and Sebastian U Stich · 2020
Later among the works it cites.
Optimal and practical algorithms for smooth and strongly convex decentralized optimization
Dmitry Kovalev, Adil Salim, and Peter Richtárik · 2020
Later among the works it cites.
A decentralized parallel algorithm for training generative adversarial nets
Mingrui Liu, Wei Zhang, Youssef Mroueh, Xiaodong Cui, Jerret Ross, Tianbao Yang, and Payel Das · 2020
Later among the works it cites.
A decentralized algorithm for large scale min-max problems
Soham Mukherjee and Mrityunjoy Chakraborty · 2020
Later among the works it cites.
Distributed gradient methods for convex machine learning problems in networks: Distributed optimization
Angelia Nedic · 2020
Later among the works it cites.
Training gans with centripetal acceleration
Wei Peng, Yu-Hong Dai, Hui Zhang, and Lizhi Cheng · 2020
Later among the works it cites.
Junchi Yang, Negar Kiyavash, and Niao He · 2020
Later among the works it cites.
Stochastic variance reduction for variational inequality methods
Ahmet Alacaoglu and Yura Malitsky · 2021
Later among the works it cites.
Forward-reflected-backward method with variance reduction
Ahmet Alacaoglu, Yura Malitsky, and Volkan Cevher · 2021
Later among the works it cites.
A decentralized adaptive momentum method for solving a class of min-max optimization problems
Babak Barazandeh, Tianjian Huang, and George Michailidis · 2021
Later among the works it cites.
Decentralized local stochastic extra-gradient for variational inequalities
Aleksandr Beznosikov, Pavel Dvurechensky, Anastasia Koloskova, Valentin Samokhin, Sebastian U Stich, and Alexander Gasnikov · 2021
Later among the works it cites.
Near-optimal decentralized algorithms for saddle point problems over time-varying networks
Aleksandr Beznosikov, Alexander Rogozin, Dmitry Kovalev, and Alexander Gasnikov · 2021
Later among the works it cites.
Distributed saddle-point problems under data similarity
Aleksandr Beznosikov, Gesualdo Scutari, Alexander Rogozin, and Alexander Gasnikov · 2021
Later among the works it cites.
Lower complexity bounds of finite-sum optimization problems: The results and construction
Yuze Han, Guangzeng Xie, and Zhihua Zhang · 2021
Later among the works it cites.
Dmitry Kovalev, Elnur Gasanov, Peter Richtárik, and Alexander Gasnikov · 2021
Later among the works it cites.
Accelerated gradient tracking over time-varying graphs for decentralized optimization
Huan Li and Zhouchen Lin · 2021
Later among the works it cites.
Decentralized distributed optimization for saddle point problems
Alexander Rogozin, Alexander Beznosikov, Darina Dvinskikh, Dmitry Kovalev, Pavel Dvurechensky, and Alexander Gasnikov · 2021
Later among the works it cites.
On accelerated methods for saddle-point problems with composite structure
Vladislav Tominin, Yaroslav Tominin, Ekaterina Borodich, Dmitry Kovalev, Alexander Gasnikov, and Pavel Dvurechensky · 2021
Later among the works it cites.
A faster decentralized algorithm for nonconvex minimax problems
Wenhan Xian, Feihu Huang, Yanfu Zhang, and Heng Huang · 2021
Later among the works it cites.
Stochastic gradient descent-ascent: Unified theory and new efficient methods
Aleksandr Beznosikov, Eduard Gorbunov, Hugo Berard, and Nicolas Loizou · 2022
Closest in time.