Provably Accelerated Randomized Gossip Algorithms

Nicolas Loizou, Michael Rabbat, Peter Richtarik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

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.
Original languageEnglish (US)
Title of host publicationICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages7505-7509
Number of pages5
ISBN (Print)9781479981311
DOIs
StatePublished - Apr 17 2019

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01

Fingerprint

Dive into the research topics of 'Provably Accelerated Randomized Gossip Algorithms'. Together they form a unique fingerprint.

Cite this