Fetching the paper…
Reading the bibliography…
We consider distributed stochastic variational inequalities (VIs) on unbounded domains with the problem data that is heterogeneous (non-IID) and distributed across many devices.
Monotone (nonlinear) operators in Hilbert space
George J. Minty · 1962
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
Galina Korpelevich · 1976
Earlier work this paper cites.
An Introduction to Variational Inequalities and Their Applications
David Kinderlehrer and Guido Stampacchia · 2000
Earlier work this paper cites.
Coordination of groups of mobile autonomous agents using nearest neighbor rules
A. Jadbabaie, Jie Lin, and A.S. Morse · 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
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Fast linear iterations for distributed averaging
Lin Xiao and Stephen Boyd · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu Nesterov · 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.
Dual extrapolation and its applications to solving variational inequalities and related problems
Yurii Nesterov · 2007
Earlier work this paper cites.
Robust Optimization
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski · 2009
Earlier work this paper cites.
Cifar-10 (canadian institute for advanced research)
Alex Krizhevsky, Vinod Nair, and Geoffrey Hinton · 2009
Earlier work this paper cites.
On distributed averaging algorithms and quantization effects
Angelia Nedic, Alex Olshevsky, Asuman Ozdaglar, and John N. Tsitsiklis · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedić and Asuman 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
Ernie Esser, Xiaoqun Zhang, and Tony F Chan · 2010
Earlier work this paper cites.
Parallelized stochastic gradient descent
Martin Zinkevich, Markus Weimer, Lihong Li, and Alex J. Smola · 2010
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.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Nemirovski, and Claire Tauvel · 2011
Earlier work this paper cites.
Distributed alternating direction method of multipliers
E. Wei and A. Ozdaglar · 2012
Earlier work this paper cites.
Diffusion strategies for adaptation and learning over networks: an examination of distributed strategies and network behavior
Ali H Sayed, Sheng-Yuan Tu, Jianshu Chen, Xiaochuan Zhao, and Zaid J Towfic · 2013
Earlier work this paper cites.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
Conditional generative adversarial nets
Mehdi Mirza and Simon Osindero · 2014
Earlier work this paper cites.
Chapter 9 - diffusion adaptation over networks*the work was supported in part by nsf grants eecs-060126, eecs-0725441, ccf-0942936, and ccf-1011918*
Ali H. Sayed · 2014
Earlier work this paper cites.
Communication-efficient distributed optimization using an approximate newton-type method
Ohad Shamir, Nati Srebro, and Tong Zhang · 2014
Earlier work this paper cites.
Communication complexity of distributed convex learning and optimization
Yossi Arjevani and Ohad Shamir · 2015
Earlier work this paper cites.
On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
Cong D Dang and Guanghui Lan · 2015
Earlier work this paper cites.
Unsupervised representation learning with deep convolutional generative adversarial networks
Alec Radford, Luke Metz, and Soumith Chintala · 2015
Earlier work this paper cites.
EXTRA: An exact first-order algorithm for decentralized consensus optimization
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin · 2015
Earlier work this paper cites.
Federated learning of deep networks using model averaging
H. Brendan McMahan, Eider Moore, Daniel Ramage, and Blaise Agüera y Arcas · 2016
Earlier work this paper cites.
A geometrically convergent method for distributed optimization over time-varying graphs
Angelia Nedich, Alex Olshevsky, and Wei Shi · 2016
Earlier work this paper cites.
Extragradient method with variance reduction for stochastic variational inequalities
Alfredo N Iusem, Alejandro Jofré, Roberto Imbuzeiro Oliveira, and Philip Thompson · 2017
Earlier work this paper cites.
Convergence analysis of two-layer neural networks with relu activation
Yuanzhi Li and Yang Yuan · 2017
Earlier work this paper cites.
Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent
Xiangru Lian, Ce Zhang, Huan Zhang, Cho-Jui Hsieh, Wei Zhang, and Ji Liu · 2017
Earlier work this paper cites.
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.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, and Laurent Massoulié · 2017
Cited alongside, same era.
Decentralized collaborative learning of personalized models over networks
Paul Vanhaesebrouck, Aurélien Bellet, and Marc Tommasi · 2017
Cited alongside, same era.
Personalized and private peer-to-peer machine learning
Aurélien Bellet, Rachid Guerraoui, Mahsa Taziki, and Marc Tommasi · 2018
Cited alongside, same era.
Training GANs with optimism
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2018
Cited alongside, same era.
Decentralize and randomize: Faster algorithm for Wasserstein barycenters
Statistically preconditioned accelerated gradient method for distributed optimization
Hadrien Hendrikx, Lin Xiao, Sebastien Bubeck, Francis Bach, and Laurent Massoulie · 2020
Later among the works it cites.
Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 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.
Tighter theory for local SGD on identical and heterogeneous data
Ahmed Khaled, Konstantin Mishchenko, and Peter Richtárik · 2020
Later among the works it cites.
A unified theory of decentralized sgd with changing topology and local updates
Anastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi, and Sebastian U Stich · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Pavel Dvurechensky, Darina Dvinskikh, Alexander Gasnikov, César A. Uribe, and Angelia Nedić · 2018
Cited alongside, same era.
An accelerated method for derivative-free smooth stochastic convex optimization
Eduard Gorbunov, Pavel Dvurechensky, and Alexander Gasnikov · 2018
Cited alongside, same era.
An alternative view: When does sgd escape local minima?
Bobby Kleinberg, Yuanzhi Li, and Yang Yuan · 2018
Cited alongside, same era.
Communication-efficient algorithms for decentralized and stochastic optimization
Guanghui Lan, Soomin Lee, and Yi Zhou · 2018
Cited alongside, same era.
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2018
Cited alongside, same era.
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati, Chuan-Sheng Foo, Vijay Chandrasekhar, and Georgios Piliouras · 2018
Cited alongside, same era.
Ray: A distributed framework for emerging ai applications, 2018
Philipp Moritz, Robert Nishihara, Stephanie Wang, Alexey Tumanov, Richard Liaw, Eric Liang, Melih Elibol, Zongheng Yang, William Paul, Michael I. Jordan, and Ion Stoica · 2018
Cited alongside, same era.
Roman Krawtschenko, César A. Uribe, Alexander Gasnikov, and Pavel Dvurechensky · 2020
Later among the works it cites.
Near-optimal algorithms for minimax optimization
Tianyi Lin, Chi Jin, and Michael I. Jordan · 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 stochastic gradient tracking methods
S. Pu and A. Nedić · 2020
Later among the works it cites.
Decentralized min-max optimization: Formulations, algorithms and applications in network poisoning attack
Ioannis Tsaknakis, Mingyi Hong, and Sijia Liu · 2020
Later among the works it cites.
Minibatch vs local SGD for heterogeneous distributed learning
Blake Woodworth, Kumar Kshitij Patel, and Nathan Srebro · 2020
Later among the works it cites.
An accelerated second-order method for distributed stochastic optimization
Artem Agafonov, Pavel Dvurechensky, Gesualdo Scutari, Alexander Gasnikov, Dmitry Kamzolov, Aleksandr Lukashevich, and Amir Daneshmand · 2021
Closest in time.
A decentralized adaptive momentum method for solving a class of min-max optimization problems
Babak Barazandeh, Tianjian Huang, and George Michailidis · 2021
Closest in time.
Solving a class of non-convex min-max games using adaptive momentum methods
Babak Barazandeh, Davoud Ataee Tarzanagh, and George Michailidis · 2021
Closest in time.
Distributed saddle-point problems: Lower bounds, optimal algorithms and federated GANs
Aleksandr Beznosikov, Valentin Samokhin, and Alexander Gasnikov · 2021
Closest in time.
Taming GANs with lookahead-minmax
Tatjana Chavdarova, Matteo Pagliardini, Sebastian U. Stich, Francois Fleuret, and Martin Jaggi · 2021
Closest in time.
Newton method over networks is fast up to the statistical precision
Amir Daneshmand, Gesualdo Scutari, Pavel Dvurechensky, and Alexander Gasnikov · 2021
Closest in time.
Local stochastic gradient descent ascent: Convergence analysis and communication efficiency
Yuyang Deng and Mehrdad Mahdavi · 2021
Closest in time.
Efficient methods for structured nonconvex-nonconcave min-max optimization
Jelena Diakonikolas, Constantinos Daskalakis, and Michael Jordan · 2021
Closest in time.
On the one-sided convergence of adam-type algorithms in non-convex non-concave min-max optimization
Zehao Dou and Yuanzhi Li · 2021
Closest in time.
Local sgd: Unified theory and new efficient methods
Eduard Gorbunov, Filip Hanzely, and Peter Richtárik · 2021
Closest in time.
Efficient algorithms for federated saddle point optimization
Charlie Hou, Kiran K Thekumparampil, Giulia Fanti, and Sewoong Oh · 2021
Closest in time.
Consensus control for decentralized deep learning
Lingjing Kong, Tao Lin, Anastasia Koloskova, Martin Jaggi, and Sebastian U. Stich · 2021
Closest in time.
Dmitry Kovalev, Elnur Gasanov, Peter Richtárik, and Alexander Gasnikov · 2021
Closest in time.
Quasi-global momentum: Accelerating decentralized deep learning on heterogeneous data
Tao Lin, Sai Praneeth Karimireddy, Sebastian U. Stich, and Martin Jaggi · 2021
Closest in time.
Decentralized distributed optimization for saddle point problems
Alexander Rogozin, Alexander Beznosikov, Darina Dvinskikh, Dmitry Kovalev, Pavel Dvurechensky, and Alexander Gasnikov · 2021
Closest in time.
An accelerated method for decentralized distributed stochastic optimization over time-varying graphs
Alexander Rogozin, Mikhail Bochko, Pavel Dvurechensky, Alexander Gasnikov, and Vladislav Lukoshkin · 2021
Closest in time.
A faster decentralized algorithm for nonconvex minimax problems
Wenhan Xian, Feihu Huang, Yanfu Zhang, and Heng Huang · 2021
Closest in time.
A unified and refined convergence analysis for non-convex decentralized learning
Sulaiman A Alghunaim and Kun Yuan · 2022
Closest in time.
Stochastic gradient descent-ascent: Unified theory and new efficient methods
Aleksandr Beznosikov, Eduard Gorbunov, Hugo Berard, and Nicolas Loizou · 2022
Closest in time.
Pavel Dvurechensky, Dmitry Kamzolov, Aleksandr Lukashevich, Soomin Lee, Erik Ordentlich, César A. Uribe, and Alexander Gasnikov · 2022
Closest in time.
Diffusion-based distributed parameter estimation through directed graphs with switching topology: Application of dynamic regressor extension and mixing
Alexey S. Matveev, Mostafa Almodarresi, Romeo Ortega, Anton Pyrkin, and Siyu Xie · 2022
Closest in time.