Publication

Social Learning under Randomized Collaborations

Ali H. Sayed
2023
Conference Papers

Abstract

We study a social learning scheme where at every time instant, each agent chooses to receive information from one of its neighbors at random. We show that under this sparser communication scheme, the agents learn the truth eventually and the asymptotic convergence rate remains the same as the standard algorithms, which use more communication resources. We also derive large deviation estimates of the log-belief ratios for a special case where each agent replaces its belief with that of the chosen neighbor.

Official source

https://infoscience.epfl.ch/entities/publication/70fced54-249d-43f5-bb6f-b6ed25abb6d7

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Social Learning under Randomized Collaborations

Chat with Graph Search

Travel Time Prediction for Congested Freeways With a Dynamic Linear Model

Observation of excited Omega(0)(c) baryons in Omega(-)(b) -> Xi(+)(c) K-pi(-) decays

A weighted empirical interpolation method: a priori convergence analysis and applications