Fetching the paper…
Reading the bibliography…
In this work we present a new framework for the analysis and design of randomized gossip algorithms for solving the average consensus problem.
Angenäherte auflösung von systemen linearer gleichungen
S. Kaczmarz · 1937
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
B.T. Polyak · 1964
Earlier work this paper cites.
Reaching a consensus
Morris H DeGroot · 1974
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate
Y. Nesterov · 1983
Earlier work this paper cites.
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
John Tsitsiklis, Dimitri Bertsekas, and Michael Athans · 1986
Earlier work this paper cites.
Dynamic load balancing for distributed memory multiprocessors
G. Cybenko · 1989
Earlier work this paper cites.
Fast linear iterations for distributed averaging
L. Xiao and S. Boyd · 2004
Earlier work this paper cites.
Generalized consensus computation in networked systems with erasure links
M.G. Rabbat, R.D. Nowak, and J.A. Bucklew · 2005
Earlier work this paper cites.
A scheme for robust distributed sensor fusion based on average consensus
L. Xiao, S. Boyd, and S. Lall · 2005
Earlier work this paper cites.
Randomized gossip algorithms
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah · 2006
Earlier work this paper cites.
Accelerated gossip algorithms for distributed computation
M. Cao, D.A. Spielman, and E.M. Yeh · 2006
Earlier work this paper cites.
Geographic gossip: Efficient averaging for sensor networks
A.G. Dimakis, A.D. Sarwate, and M.J. Wainwright · 2008
Earlier work this paper cites.
Greedy gossip with eavesdropping
D. Ustebay, M. Coates, and M. Rabbat · 2008
Earlier work this paper cites.
Broadcast gossip algorithms for consensus
T.C. Aysal, M.E. Yildiz, A.D. Sarwate, and A. Scaglione · 2009
Earlier work this paper cites.
Polynomial filtering for fast convergence in distributed consensus
E. Kokiopoulou and P. Frossard · 2009
Earlier work this paper cites.
Convergence speed in distributed consensus and averaging
A. Olshevsky and J.N. Tsitsiklis · 2009
Earlier work this paper cites.
A randomized Kaczmarz algorithm with exponential convergence
T. Strohmer and R. Vershynin · 2009
Earlier work this paper cites.
Order-optimal consensus through randomized path averaging
F. Bénézit, A.G. Dimakis, P. Thiran, and M. Vetterli · 2010
Earlier work this paper cites.
Gossip algorithms for distributed signal processing
A.G. Dimakis, S. Kar, J.M.F. Moura, M.G. Rabbat, and A. Scaglione · 2010
Earlier work this paper cites.
Randomized methods for linear constraints: convergence rates and conditioning
D. Leventhal and A.S. Lewis · 2010
Earlier work this paper cites.
Deterministic gossiping with a periodic protocol
S. Mou, C. Yu, B.D.O Anderson, and A. S. Morse · 2010
Earlier work this paper cites.
Randomized Kaczmarz solver for noisy linear systems
D. Needell · 2010
Earlier work this paper cites.
Optimization and analysis of distributed averaging with short node memory
B. N. Oreshkin, M. J. Coates, and M. G. Rabbat · 2010
Earlier work this paper cites.
Acceleration of randomized Kaczmarz method via the Johnson–Lindenstrauss lemma
Y.C. Eldar and D. Needell · 2011
Earlier work this paper cites.
Periodic gossiping
F. He, A. S. Morse, J. Liu, and S. Mou · 2011
Earlier work this paper cites.
Deterministic gossiping
Ji Liu, Shaoshuai Mou, A Stephen Morse, Brian DO Anderson, and Changbin Yu · 2011
Earlier work this paper cites.
Distributed cooperative spectrum sensing based on weighted average consensus
W. Zhang, Z. Wang, Y. Guo, H. Liu, Y. Chen, and J. Mitola III · 2011
Earlier work this paper cites.
Dual averaging for distributed optimization: convergence analysis and network scaling
J.C. Duchi, A. Agarwal, and M.J. Wainwright · 2012
Earlier work this paper cites.
Fast distributed smoothing of relative measurements
N.M. Freris and A. Zouzias · 2012
Earlier work this paper cites.
Imagenet classification with deep convolutional neural networks
A. Krizhevsky, I. Sutskever, and G.E. Hinton · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Earlier work this paper cites.
Communication/computation tradeoffs in consensus-based distributed optimization
K. Tsianos, S. Lawlor, and M. G. Rabbat · 2012
Earlier work this paper cites.
Analysis of accelerated gossip algorithms
J. Liu, B.D.O. Anderson, M. Cao, and A.S. Morse · 2013
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss
Sh. Shalev-Shwartz and T. Zhang · 2013
Cited alongside, same era.
On the importance of initialization and momentum in deep learning
I. Sutskever, J. Martens, G.E. Dahl, and G.E. Hinton · 2013
Cited alongside, same era.
On the o (1= k) convergence of asynchronous distributed alternating direction method of multipliers
E. Wei and A. Ozdaglar · 2013
Cited alongside, same era.
Randomized extended Kaczmarz for solving least squares
A. Zouzias and N.M. Freris · 2013
Cited alongside, same era.
Linear convergence of the randomized sparse Kaczmarz method
F. Schöpfer and D.A. Lorenz · 2016
Later among the works it cites.
On the convergence of decentralized gradient descent
K. Yuan, Q. Ling, and W. Yin · 2016
Later among the works it cites.
Decentralized computation of effective resistances and acceleration of consensus algorithms
N. S. Aybat and M. Gürbüzbalaban · 2017
Later among the works it cites.
A sampling Kaczmarz–Motzkin algorithm for linear feasibility
J. A. De Loera, J. Haddock, and D. Needell · 2017
Later among the works it cites.
Randomized quasi-newton updates are linearly convergent matrix inversion algorithms
R. M. Gower and P. Richtárik · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the randomized Kaczmarz algorithm
L. Dai, M. Soltanalian, and K. Pelckmans · 2014
Cited alongside, same era.
The admm algorithm for distributed averaging: Convergence rates and optimal parameter selection
E. Ghadimi, A. Teixeira, M.G. Rabbat, and M. Johansson · 2014
Cited alongside, same era.
Rate analysis of inexact dual first-order methods application to dual decomposition
I. Necoara and V. Nedelcu · 2014
Cited alongside, same era.
Paved with good intentions: analysis of a randomized block Kaczmarz method
D. Needell and J.A. Tropp · 2014
Cited alongside, same era.
A. Olshevsky · 2014
Cited alongside, same era.
Convergence of weighted-average consensus for undirected graphs
F. Pedroche Sánchez, M. Rebollo Pedruelo, C. Carrascosa Casamayor, and A. Palomares Chust · 2014
Cited alongside, same era.
F. Hanzely, J. Konečný, N. Loizou, P. Richtárik, and D. Grishchenko · 2017
Later among the works it cites.
Yang Liu, Bo Li, Brian Anderson, and Guodong Shi · 2017
Later among the works it cites.
Linearly convergent stochastic heavy ball method for minimizing generalization error
N. Loizou and P. Richtárik · 2017
Later among the works it cites.
N. Loizou and P. Richtárik · 2017
Later among the works it cites.
Convergence rates for Kaczmarz-type algorithms
C. Popa · 2017
Later among the works it cites.
Stochastic reformulations of linear systems: algorithms and convergence theory
P. Richtárik and M. Takáč · 2017
Later among the works it cites.
Breaking locality accelerates block Gauss-Seidel
S. Tu, S. Venkataraman, A.C. Wilson, A. Gittens, M.I. Jordan, and B. Recht · 2017
Later among the works it cites.
The marginal value of adaptive gradient methods in machine learning
A.C. Wilson, R. Roelofs, M. Stern, N. Srebro, and B. Recht · 2017
Later among the works it cites.
Distributed averaging using periodic gossiping
C. B. Yu, B.D.O Anderson, S. Mou, J. Liu, F. He, and A. S. Morse · 2017
Later among the works it cites.
Stochastic gradient push for distributed deep learning
M. Assran, N. Loizou, N. Ballas, and M. Rabbat · 2018
Later among the works it cites.
M. Assran and M. Rabbat · 2018
Later among the works it cites.
Accelerated stochastic matrix inversion: general theory and speeding up BFGS rules for faster second-order optimization
R.M. Gower, F. Hanzely, P. Richtárik, and S. U. Stich · 2018
Later among the works it cites.
On motzkin’s method for inconsistent linear systems
J. Haddock and D. Needell · 2018
Later among the works it cites.
A privacy preserving randomized gossip algorithm via controlled noise insertion
F. Hanzely, J. Konečnỳ, N. Loizou, P. Richtárik, and D. Grishchenko · 2018
Later among the works it cites.
Accelerated decentralized optimization with local updates for smooth and strongly convex objectives
H. Hendrikx, L. Massoulié, and F. Bach · 2018
Later among the works it cites.
Improved weighted average consensus in distributed cooperative spectrum sensing networks
A. G. Hernandes, M. L. Proença Jr, and T. Abrão · 2018
Later among the works it cites.
Asynchronous decentralized parallel stochastic gradient descent
X. Lian, C. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu · 2018
Later among the works it cites.
Privacy-preserving gossip algorithms
Y. Liu, J. Wu, I. Manchester, and G. Shi · 2018
Later among the works it cites.
Accelerated gossip via stochastic heavy ball method
N. Loizou and P. Richtárik · 2018
Later among the works it cites.
Network topology and communication-computation tradeoffs in decentralized optimization
A. Nedić, A. Olshevsky, and M. G. Rabbat · 2018
Later among the works it cites.
Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
K. Du · 2019
Closest in time.
SGD: General analysis and improved rates
R. M. Gower, N. Loizou, X. Qian, A. Sailanbayev, E. Shulgin, and P. Richtarik · 2019
Closest in time.
Decentralized stochastic optimization and gossip algorithms with compressed communication
A. Koloskova, S. U. Stich, and M. Jaggi · 2019
Closest in time.
Provably accelerated randomized gossip algorithms
N. Loizou, M. Rabbat, and P. Richtárik · 2019
Closest in time.
Convergence analysis of inexact randomized iterative methods
N. Loizou and P. Richtárik · 2019
Closest in time.
Accelerated sampling Kaczmarz Motzkin algorithm for linear feasibility problem
M. S. Morshed, M.S. Islam, et al · 2019
Closest in time.