In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes.
Reading the bibliography…
Algebraic connectivity of graphs
Miroslav Fiedler · 1973
Earlier work this paper cites.
Problems in decentralized decision making and computation
John Nikolas Tsitsiklis · 1984
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.
Parallel and distributed computation: numerical methods
Dimitri P Bertsekas and John N Tsitsiklis · 1989
Earlier work this paper cites.
Dynamic load balancing for distributed memory multiprocessors
George Cybenko · 1989
Earlier work this paper cites.
The capacity of wireless networks
Piyush Gupta and Panganmala R Kumar · 2000
Earlier work this paper cites.
Gossip-based computation of aggregate information
David Kempe, Alin Dobra, and Johannes Gehrke · 2003
Earlier work this paper cites.
Random geometric graphs
Mathew Penrose · 2003
Earlier work this paper cites.
Fast linear iterations for distributed averaging
Lin Xiao and Stephen Boyd · 2004
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.
Consensus and cooperation in networked multi-agent systems
Reza Olfati-Saber, J Alex Fax, and Richard M Murray · 2007
Earlier work this paper cites.
Information consensus in multivehicle cooperative control
Wei Ren, Randal W Beard, and Ella M Atkins · 2007
Earlier work this paper cites.
Geographic gossip: Efficient averaging for sensor networks
Alexandros DG Dimakis, Anand D Sarwate, and Martin J Wainwright · 2008
Earlier work this paper cites.
Broadcast gossip algorithms for consensus
Tuncer Can Aysal, Mehmet Ercan Yildiz, Anand D Sarwate, and Anna Scaglione · 2009
Earlier work this paper cites.
Gossip algorithms
Devavrat Shah · 2009
Earlier work this paper cites.
Order-optimal consensus through randomized path averaging
Florence Bénézit, Alexandros G Dimakis, Patrick Thiran, and Martin Vetterli · 2010
Earlier work this paper cites.
Gossip algorithms for distributed signal processing
Alexandros G Dimakis, Soummya Kar, José MF Moura, Michael G Rabbat, and Anna Scaglione · 2010
Earlier work this paper cites.
Randomized methods for linear constraints: Convergence rates and conditioning
Dennis Leventhal and Adrian S. Lewis · 2010
Cited alongside, same era.
Deterministic gossiping with a periodic protocol
Shaoshuai Mou, Changbin Yu, Brian DO Anderson, and A Stephen Morse · 2010
Cited alongside, same era.
Distributed averaging in sensor networks based on broadcast gossip algorithms
Mauro Franceschelli, Alessandro Giua, and Carla Seatzu · 2011
Cited alongside, same era.
Periodic gossiping
Fenghua He, A Stephen Morse, Ji Liu, and Shaoshuai Mou · 2011
Cited alongside, same era.
Deterministic gossiping
Ji Liu, Shaoshuai Mou, A Stephen Morse, Brian DO Anderson, and Changbin Yu · 2011
Cited alongside, same era.
Fast distributed smoothing of relative measurements
Nikolaos M Freris and Anastasios Zouzias · 2012
Cited alongside, same era.
Differentially private iterative synchronous consensus
Zhenqi Huang, Sayan Mitra, and Geir Dullerud · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Cited alongside, same era.
Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
Shai Shalev-Shwartz and Tong Zhang · 2012
Cited alongside, same era.
Smooth minimization of nonsmooth functions by parallel coordinate descent
Olivier Fercoq and Peter Richtárik · 2013
Cited alongside, same era.
Performance comparison of randomized gossip, broadcast gossip and collection tree protocol for distributed averaging
Ye Yu Jun and Michael Rabbat · 2013
Cited alongside, same era.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Yin Tat Lee and Aaron Sidford · 2013
Cited alongside, same era.
Accelerated, parallel and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2015
Later among the works it cites.
Randomized iterative methods for linear systems
Robert Mansel Gower and Peter Richtárik · 2015
Later among the works it cites.
Stochastic dual ascent for solving linear systems
Robert Mansel Gower and Peter Richtárik · 2015
Later among the works it cites.
Quartz: Randomized dual coordinate ascent with arbitrary sampling
Zheng Qu, Peter Richtárik, and Tong Zhang · 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.
Accelerating distributed averaging in sensor networks: Randomized gossip over virtual coordinates
Valerio Freschi, Emanuele Lattanzi, and Alessandro Bogliolo · 2016
Later among the works it cites.
Stochastic block BFGS: squeezing more curvature out of data
Robert Mansel Gower, Donald Goldfarb, and Peter Richtárik · 2016
Later among the works it cites.
Linearly convergent randomized iterative methods for computing the pseudoinverse
Robert Mansel Gower and Peter Richtárik · 2016
Later among the works it cites.
Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
Robert Mansel Gower and Peter Richtárik · 2016
Later among the works it cites.
A new perspective on randomized gossip algorithms
Nicolas Loizou and Peter Richtárik · 2016
Later among the works it cites.
Coordinate descent with arbitrary sampling I: algorithms and complexity
Zheng Qu and Richtárik · 2016
Later among the works it cites.
Coordinate descent with arbitrary sampling II: expected separable overapproximation
Zheng Qu and Richtárik · 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.
Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications
Antonin Chambolle, Matthias J. Ehrhardt, Peter Richtárik, and Carola-Bibiane Schoenlieb · 2017
Closest in time.
Fast distributed consensus through path averaging on random walks
Valerio Freschi, Emanuele Lattanzi, and Alessandro Bogliolo · 2017
Closest in time.
Privacy preserving average consensus
Yilin Mo and Richard M Murray · 2017
Closest in time.
Stochastic reformulations of linear systems: algorithms and convergence theory
Peter Richtárik and Martin Takáč · 2017
Closest in time.
Distributed averaging using periodic gossiping
Changbin Brad Yu, Brian DO Anderson, Shaoshuai Mou, Ji Liu, Fenghua He, and A Stephen Morse · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…