Provably Accelerated Randomized Gossip Algorithms
Abstract
In this work we present novel provably accelerated gossip algorithms for solving the average consensus problem. The proposed protocols are inspired from the recently developed accelerated variants of the randomized Kaczmarz method - a popular method for solving linear systems. In each gossip iteration all nodes of the network update their values but only a pair of them exchange their private information. Numerical experiments on popular wireless sensor networks showing the benefits of our protocols are also presented.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2018
- DOI:
- 10.48550/arXiv.1810.13084
- arXiv:
- arXiv:1810.13084
- Bibcode:
- 2018arXiv181013084L
- Keywords:
-
- Mathematics - Optimization and Control;
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing;
- Computer Science - Machine Learning;
- Computer Science - Multiagent Systems;
- Computer Science - Systems and Control