Communication-efficient Distributed Cooperative Learning with Compressed Beliefs
We study the problem of distributed cooperative learning, where a group of agents seeks to agree on a set of hypotheses that best describes a sequence of private observations. In the scenario where the set of hypotheses is large, we propose a belief update rule where agents share compressed (either sparse or quantized) beliefs with an arbitrary positive compression rate. Our algorithm leverages a unified communication rule that enables agents to access wide-ranging compression operators as black-box modules. We prove the almost sure asymptotic exponential convergence of beliefs around the set of optimal hypotheses. Additionally, we show a non-asymptotic, explicit, and linear concentration rate in probability of the beliefs on the optimal hypothesis set. We provide numerical experiments to illustrate the communication benefits of our method. The simulation results show that the number of transmitted bits can be reduced to 5-10% of the non-compressed method in the studied scenarios.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Robust Asynchronous and Network-Independent Cooperative Learning
We consider the model of cooperative learning via distributed non-Bayesian learning, where a network of agents tries to jointly agree on a hypothesis that best described a sequence of locally available observations. Buil…
A mathematical theory of cooperative communication
Cooperative communication plays a central role in theories of human cognition, language, development, culture, and human-robot interaction. Prior models of cooperative communication are algorithmic in nature and do not s…
Cultural Vocal Bursts Intensity PredictionCooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs
Recently, there has been extensive study of cooperative multi-agent multi-armed bandits where a set of distributed agents cooperatively play the same multi-armed bandit game. The goal is to develop bandit algorithms with…
Multi-Armed BanditsDistributed Adaptive Learning Under Communication Constraints
This work examines adaptive distributed learning strategies designed to operate under communication constraints. We consider a network of agents that must solve an online optimization problem from continual observation o…
Scale-free Distributed Cooperative Voltage Control of Inverter-based Microgrids with General Time-varying Communication Graphs
This paper presents a method for controlling the voltage of inverter-based Microgrids by proposing a new scale-free distributed cooperative controller. The communication network is modeled by a general time-varying graph…