Fetching the paper…
Reading the bibliography…
We consider the problem of training machine learning models on distributed data in a decentralized way.
Some applications of laplace eigenvalues of graphs
Bojan Mohar · 1997
Earlier work this paper cites.
Random graphs
Béla Bollobás · 2001
Earlier work this paper cites.
Rcv1: A new benchmark collection for text categorization research
David D Lewis, Yiming Yang, Tony G Rose, and Fan Li · 2004
Earlier work this paper cites.
Randomized gossip algorithms
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah · 2006
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedic and Asuman Ozdaglar · 2009
Earlier work this paper cites.
Large-scale machine learning with stochastic gradient descent
Léon Bottou · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Earlier work this paper cites.
Dual averaging for distributed optimization: Convergence analysis and network scaling
John C. Duchi, Alekh Agarwal, and Martin J. Wainwright · 2012
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course , volume 87
Yurii Nesterov · 2013
Earlier work this paper cites.
Stochastic dual coordinate ascent methods for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Earlier work this paper cites.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Earlier work this paper cites.
Linear convergence rate of a class of distributed augmented Lagrangian algorithms
Dušan Jakovetić, José M. F. Moura, and Joao Xavier · 2014
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
Cited alongside, same era.
DSA: Decentralized double stochastic averaging gradient algorithm
Aryan Mokhtari and Alejandro Ribeiro · 2016
Cited alongside, same era.
SDCA without duality, regularization, and individual convexity
Shai Shalev-Shwartz · 2016
Cited alongside, same era.
A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
Heinz H. Bauschke, Jérôme Bolte, and Marc Teboulle · 2017
Cited alongside, same era.
An optimal randomized incremental gradient method
Guanghui Lan and Yi Zhou · 2017
Cited alongside, same era.
Catalyst acceleration for first-order convex optimization: from theory to practice
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2017
Relatively smooth convex optimization by first-order methods, and applications
Haihao Lu, Robert M. Freund, and Yurii Nesterov · 2018
Later among the works it cites.
Towards more efficient stochastic decentralized learning: Faster convergence and sparse communication
Zebang Shen, Aryan Mokhtari, Tengfei Zhou, Peilin Zhao, and Hui Qian · 2018
Later among the works it cites.
Darina Dvinskikh and Alexander Gasnikov · 2019
Later among the works it cites.
A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates
Zhi Li, Wei Shi, and Ming Yan · 2019
Later among the works it cites.
Optimal convergence rates for convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Lee, and Laurent Massoulié · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Achieving geometric convergence for distributed optimization over time-varying graphs
Angelia Nedic, Alex Olshevsky, and Wei Shi · 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.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Cited alongside, same era.
Exploiting strong convexity from data with primal-dual first-order algorithms
Jialei Wang and Lin Xiao · 2017
Cited alongside, same era.
A unification and generalization of exact distributed first-order methods
Dušan Jakovetić · 2018
Cited alongside, same era.
A sharp convergence rate analysis for distributed accelerated gradient methods
Huan Li, Cong Fang, Wotao Yin, and Zhouchen Lin · 2018
Cited alongside, same era.
DSCOVR: Randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
Lin Xiao, Adams Wei Yu, Qihang Lin, and Weizhu Chen · 2019
Later among the works it cites.
Accelerated gossip in networks of given dimension using jacobi polynomial iterations
Raphaël Berthier, Francis Bach, and Pierre Gaillard · 2020
Closest in time.
An optimal algorithm for decentralized finite sum optimization
Hadrien Hendrikx, Francis Bach, and Laurent Massoulié · 2020
Closest in time.
Revisiting EXTRA for smooth distributed optimization
Huan Li and Zhouchen Lin · 2020
Closest in time.
A dual approach for optimal algorithms in distributed optimization over networks
César A. Uribe, Soomin Lee, Alexander Gasnikov, and Angelia Nedić · 2020
Closest in time.
Decentralized stochastic optimization and machine learning: A unified variance-reduction framework for robust performance and fast convergence
Ran Xin, Soummya Kar, and Usman A Khan · 2020
Closest in time.
Distributed algorithms for composite optimization: Unified and tight convergence analysis
Jinming Xu, Ye Tian, Ying Sun, and Gesualdo Scutari · 2020
Closest in time.