Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation over Adaptive Networks
Sheng-Yuan Tu, Ali H. Sayed

TL;DR
This paper compares diffusion and consensus strategies in adaptive networks, demonstrating that diffusion strategies outperform consensus in convergence speed, stability, and mean-square deviation, especially under constant step-sizes.
Contribution
The study provides a theoretical and empirical comparison showing diffusion strategies are more robust and stable than consensus strategies for distributed estimation.
Findings
Diffusion strategies converge faster than consensus strategies.
Diffusion networks reach lower mean-square deviation.
Consensus networks can become unstable even if individual nodes are stable.
Abstract
Adaptive networks consist of a collection of nodes with adaptation and learning abilities. The nodes interact with each other on a local level and diffuse information across the network to solve estimation and inference tasks in a distributed manner. In this work, we compare the mean-square performance of two main strategies for distributed estimation over networks: consensus strategies and diffusion strategies. The analysis in the paper confirms that under constant step-sizes, diffusion strategies allow information to diffuse more thoroughly through the network and this property has a favorable effect on the evolution of the network: diffusion networks are shown to converge faster and reach lower mean-square deviation than consensus networks, and their mean-square stability is insensitive to the choice of the combination weights. In contrast, and surprisingly, it is shown that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
