Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

Olshevsky, Alex; Paschalidis, Ioannis Ch.; Spiridonoff, Artin

doi:10.48550/arxiv.1802.08634

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [12], the authors considered a fixed rate of decay of O(1/k) and showed learning is achieved for both fixed and time-varying graphs that are always connected. Other authors have considered the phenomena of asymptotic isolation of agents in a network assuming the intervals of intercommunication between them increase with time [14], [15].…”

Section: Introductionmentioning

confidence: 99%

On Increasing Self-Confidence in Non-Bayesian Social Learning over Time-Varying Directed Graphs

Uribe

Jadbabaie

2019

2019 American Control Conference (ACC)

View full text Add to dashboard Cite

We study the convergence of the log-linear non-Bayesian social learning update rule, for a group of agents that collectively seek to identify a parameter that best describes a joint sequence of observations. Contrary to recent literature, we focus on the case where agents assign decaying weights to its neighbors, and the network is not connected at every time instant but over some finite time intervals. We provide a necessary and sufficient condition for the rate at which agents decrease the weights and still guarantees social learning.

show abstract

Section: Introductionmentioning

confidence: 99%