scispace - formally typeset
Proceedings ArticleDOI

Diffusion networks outperform consensus networks

TLDR
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 reach lower mean-square deviation than consensus networks, and their mean- square stability is insensitive to the choice of the combination weights.
Abstract
Adaptive networks consist of a collection of nodes that 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 performance of two distributed estimation strategies: diffusion and consensus. Diffusion strategies allow information to diffuse more thoroughly through the network. The analysis in the paper confirms that this property has a favorable effect on the evolution of the network: diffusion networks reach lower mean-square deviation than consensus networks, and their mean-square stability is insensitive to the choice of the combination weights. In contrast, consensus networks can become unstable even if all the individual nodes are mean-square stable; this does not occur for diffusion networks: stability of the individual nodes ensures stability of the diffusion network irrespective of the topology.

read more

Citations
More filters
Journal ArticleDOI

Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks

TL;DR: An adaptive diffusion mechanism to optimize global cost functions in a distributed manner over a network of nodes, which endow networks with adaptation abilities that enable the individual nodes to continue learning even when the cost function changes with time.
Journal ArticleDOI

Diffusion strategies for adaptation and learning over networks: an examination of distributed strategies and network behavior

TL;DR: It is shown that it is an extraordinary property of biological networks that sophisticated behavior is able to emerge from simple interactions among lower-level agents.
Journal ArticleDOI

Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation Over Adaptive Networks

TL;DR: It is confirmed 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.
Book ChapterDOI

Diffusion adaptation over networks

TL;DR: Adaptive networks are well suited to perform decentralized information processing and optimization tasks and to model various types of self-organized and complex behavior encountered in nature as discussed by the authors, where agents are linked together through a connection topology, and they cooperate with each other through local interactions to solve distributed optimization, estimation, and inference problems in real-time.
Journal ArticleDOI

Performance Limits for Distributed Estimation Over LMS Adaptive Networks

TL;DR: This work analyzes the mean-square performance of different strategies for distributed estimation over least-mean-squares (LMS) adaptive networks and establishes that, for sufficiently small step-sizes, diffusion strategies can outperform centralized block or incremental LMS strategies by optimizing over left-stochastic combination weighting matrices.
References
More filters
Journal ArticleDOI

Consensus problems in networks of agents with switching topology and time-delays

TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Journal ArticleDOI

Coordination of groups of mobile autonomous agents using nearest neighbor rules

TL;DR: A theoretical explanation for the observed behavior of the Vicsek model, which proves to be a graphic example of a switched linear system which is stable, but for which there does not exist a common quadratic Lyapunov function.
Book

Parallel and Distributed Computation: Numerical Methods

TL;DR: This work discusses parallel and distributed architectures, complexity measures, and communication and synchronization issues, and it presents both Jacobi and Gauss-Seidel iterations, which serve as algorithms of reference for many of the computational approaches addressed later.
Journal ArticleDOI

Reaching a Consensus

TL;DR: In this article, the authors consider a group of individuals who must act together as a team or committee, and assume that each individual in the group has his own subjective probability distribution for the unknown value of some parameter.
Journal ArticleDOI

Distributed asynchronous deterministic and stochastic gradient optimization algorithms

TL;DR: A model for asynchronous distributed computation is presented and it is shown that natural asynchronous distributed versions of a large class of deterministic and stochastic gradient-like algorithms retain the desirable convergence properties of their centralized counterparts.
Related Papers (5)