Fetching the paper…
Reading the bibliography…
In this paper, we study the problem of minimizing a sum of smooth and strongly convex functions split over the nodes of a network in a decentralized fashion.
Reaching a consensus
Morris H DeGroot · 1974
Earlier work this paper cites.
Towards consensus: Some convergence theorems on repeated averaging
Samprit Chatterjee and Eugene Seneta · 1977
Earlier work this paper cites.
Tutorial on large deviations for the binomial distribution
Richard Arratia and Louis Gordon · 1989
Earlier work this paper cites.
Synchronization and linearity: an algebra for discrete event systems
François Baccelli, Guy Cohen, Geert Jan Olsder, and Jean-Pierre Quadrat · 1992
Earlier work this paper cites.
Some applications of laplace eigenvalues of graphs
Bojan Mohar · 1997
Earlier work this paper cites.
Efficient schemes for nearest neighbor load balancing
Ralf Diekmann, Andreas Frommer, and Burkhard Monien · 1999
Earlier work this paper cites.
Analysis of a nonreversible markov chain sampler
Persi Diaconis, Susan Holmes, and Radford M Neal · 2000
Earlier work this paper cites.
A scheme for robust distributed sensor fusion based on average consensus
Lin Xiao, Stephen Boyd, and Sanjay Lall · 2005
Earlier work this paper cites.
Randomized gossip algorithms
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah · 2006
Earlier work this paper cites.
Accelerated gossip algorithms for distributed computation
Ming Cao, Daniel A Spielman, and Edmund M Yeh · 2006
Earlier work this paper cites.
Geographic gossip: efficient aggregation for sensor networks
Alexandros G Dimakis, Anand D Sarwate, and Martin J Wainwright · 2006
Earlier work this paper cites.
Location-aided fast distributed consensus
Wenjun Li, Huaiyu Dai, and Y Zhang · 2007
Earlier work this paper cites.
On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization
Sham Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedic and Asuman Ozdaglar · 2009
Earlier work this paper cites.
Asynchronous gossip algorithms for stochastic optimization
S Sundhar Ram, A Nedić, and Venugopal V Veeravalli · 2009
Cited alongside, same era.
Gossip algorithms for distributed signal processing
Alexandros G Dimakis, Soummya Kar, José MF Moura, Michael G Rabbat, and Anna Scaglione · 2010
Cited alongside, same era.
Optimization and analysis of distributed averaging with short node memory
Boris N Oreshkin, Mark J Coates, and Michael G Rabbat · 2010
Cited alongside, same era.
Distributed stochastic subgradient projection algorithms for convex optimization
S Sundhar Ram, Angelia Nedić, and Venugopal V Veeravalli · 2010
Cited alongside, same era.
Parallelized stochastic gradient descent
Martin Zinkevich, Markus Weimer, Lihong Li, and Alex J Smola · 2010
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Asynchronous stochastic coordinate descent: Parallelism and convergence properties
Ji Liu and Stephen J Wright · 2015
Later among the works it cites.
An asynchronous parallel stochastic coordinate descent algorithm
Ji Liu, Stephen J Wright, Christopher Ré, Victor Bittorf, and Srikrishna Sridhar · 2015
Later among the works it cites.
Extra: An exact first-order algorithm for decentralized consensus optimization
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin · 2015
Later among the works it cites.
Even faster accelerated coordinate descent using non-uniform sampling
Zeyuan Allen-Zhu, Zheng Qu, Peter Richtárik, and Yang Yuan · 2016
Later among the works it cites.
Gossip dual averaging for decentralized optimization of pairwise functions
Igor Colin, Aurélien Bellet, Joseph Salmon, and Stéphan Clémençon · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, Jonathan Eckstein, et al · 2011
Cited alongside, same era.
Hogwild: A lock-free approach to parallelizing stochastic gradient descent
Benjamin Recht, Christopher Re, Stephen Wright, and Feng Niu · 2011
Cited alongside, same era.
Dual averaging for distributed optimization: Convergence analysis and network scaling
John C Duchi, Alekh Agarwal, and Martin J Wainwright · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Cited alongside, same era.
Multi-step gradient methods for networked optimization
Euhanna Ghadimi, Iman Shames, and Mikael Johansson · 2013
Cited alongside, same era.
Analysis of accelerated gossip algorithms
Ji Liu, Brian DO Anderson, Ming Cao, and A Stephen Morse · 2013
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course , volume 87
Yurii Nesterov · 2013
Cited alongside, same era.
Dsa: Decentralized double stochastic averaging gradient algorithm
Aryan Mokhtari and Alejandro Ribeiro · 2016
Later among the works it cites.
Parallel coordinate descent methods for big data optimization
Peter Richtárik and Martin Takáč · 2016
Later among the works it cites.
Random block coordinate descent methods for linearly constrained optimization over networks
Ion Necoara, Yurii Nesterov, and François Glineur · 2017
Later among the works it cites.
Achieving geometric convergence for distributed optimization over time-varying graphs
Angelia Nedic, Alex Olshevsky, and Wei Shi · 2017
Later among the works it cites.
Efficiency of the accelerated coordinate descent method on structured optimization problems
Yurii Nesterov and Sebastian U Stich · 2017
Later among the works it cites.
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
Later among the works it cites.
Robert M Gower, Filip Hanzely, Peter Richtárik, and Sebastian Stich · 2018
Closest in time.
Accelerated gossip via stochastic heavy ball method
Nicolas Loizou and Peter Richtárik · 2018
Closest in time.
d 2 d^{2} : Decentralized training over decentralized data
Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, and Ji Liu · 2018
Closest in time.