Weighted gossip: Distributed averaging using non-doubly stochastic matrices
Name
Tsitsiklis_Weighted gossip.pdf
Size
203.86 KB
Format
Adobe PDF
Checksum (MD5)
5b3eda86b2656dbc29d46646339d12e6
Author(s)
Tsitsiklis, John N.
Benezit, Florence
Blondel, Vincent D.
Thiran, Patrick
Vetterli, Martin
Date Issued
July 2010
Journal
Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Tsitsiklis, John N. et al. "Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices." Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT): 1753-1757. © 2010 IEEE.
Version
Final published version
Abstract
This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any connected, directed or undirected graph. Unlike most previous gossip algorithms, Weighted Gossip admits stochastic update matrices which need not be doubly stochastic. Double-stochasticity being very restrictive in a distributed setting, this novel degree of freedom is essential and it opens the perspective of designing a large number of new gossip-based algorithms. To give an example, we present one of these algorithms, which we call One-Way Averaging. It is based on random geographic routing, just like Path Averaging, except that routes are one way instead of round trip. Hence in this example, getting rid of double stochasticity allows us to add robustness to Path Averaging.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2010.5513273
