Network independent rates in distributed learning

Angelia Nedić, Alex Olshevsky, César A. Uribe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations


We propose a novel belief update algorithm for Distributed Non-Bayesian learning over time-varying directed graphs, where a group of agents tries to collectively select a distribution that best describes the observed data. We show that the proposed update rule, inspired by the Push-Sum algorithm, is consistent; moreover we provide an explicit characterization of its convergence rate. Our main result states that, after a transient time, all agents will concentrate their beliefs at a network independent rate. Network independent rates were not available for other consensus based distributed learning algorithms on time-varying directed graphs.

Original languageEnglish (US)
Title of host publication2016 American Control Conference, ACC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781467386821
StatePublished - Jul 28 2016
Externally publishedYes
Event2016 American Control Conference, ACC 2016 - Boston, United States
Duration: Jul 6 2016Jul 8 2016

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619


Other2016 American Control Conference, ACC 2016
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Network independent rates in distributed learning'. Together they form a unique fingerprint.

Cite this