By Topic

On the Influence of Informed Agents on Learning and Adaptation Over Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sheng-Yuan Tu ; Dept. of Electr. Eng., Univ. of California, Los Angeles, Los Angeles, CA, USA ; Sayed, A.H.

Adaptive networks consist of a collection of agents with adaptation and learning abilities. The agents interact with each other on a local level and diffuse information across the network through their collaboration. In this work, we consider two types of agents: informed agents and uninformed agents. The former receive new data regularly and perform consultation and in-network processing, while the latter do not collect data and only participate in the consultation tasks. We examine the performance of LMS diffusion strategies for distributed estimation over networks as a function of the proportion of informed agents and their distribution in space. The results reveal some interesting trade-offs between convergence rate and mean-square performance. In particular, among other results, it is shown that the mean-square performance of adaptive networks does not necessarily improve with a larger proportion of informed agents. Instead, it is established that if the set of informed agents is enlarged, the convergence rate of the network becomes faster albeit at the expense of some deterioration in mean-square performance. The results further establish that uninformed agents play an important role in determining the steady-state performance of the network and that it is preferable to keep some of the highly noisy or highly connected agents uninformed. The arguments reveal an important interplay among three factors: the number and distribution of informed agents in the network, the convergence rate of the learning process, and the estimation accuracy in steady-state. Expressions that quantify these relations are derived, and simulations are included to support the theoretical findings. We illustrate application of the results to two network models, namely, the Erdos-Renyi and scale-free models.

Published in:

Signal Processing, IEEE Transactions on  (Volume:61 ,  Issue: 6 )