Skip to main navigation Skip to search Skip to main content

Efficient learning by consensus over regular networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In a network, each agent communicates with its neighbors. All the agents have initial observations, and they update their beliefs with the average of the beliefs in their neighborhoods. It is well known that in the long run, the network will reach consensus. However, the agents do not necessarily converge to the global average of the initial observations of all the agents in the network. Instead, the result is always a weighted average. Moreover, it takes infinite time for the process to converge. In this paper, we address regular networks of agents, where each agent (node) has the same number of agents. We propose a method that allows agents in these networks to learn the global average using the history of its local average in finite time.

Original languageEnglish
Title of host publication2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages7253-7257
Number of pages5
ISBN (Print)9781479928927
DOIs
StatePublished - 2014
Event2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014 - Florence, Italy
Duration: May 4 2014May 9 2014

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Conference

Conference2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014
Country/TerritoryItaly
CityFlorence
Period05/4/1405/9/14

Keywords

  • Consensus
  • efficient learning
  • learning in agent networks
  • regular graphs

Fingerprint

Dive into the research topics of 'Efficient learning by consensus over regular networks'. Together they form a unique fingerprint.

Cite this