Optimal Aggregation Strategies for Social Learning over Graphs

by   Ping Hu, et al.

Adaptive social learning is a useful tool for studying distributed decision-making problems over graphs. This paper investigates the effect of combination policies on the performance of adaptive social learning strategies. Using large-deviation analysis, it first derives a bound on the probability of error and characterizes the optimal selection for the Perron eigenvectors of the combination policies. It subsequently studies the effect of the combination policy on the transient behavior of the learning strategy by estimating the adaptation time in the small signal-to-noise ratio regime. In the process, it is discovered that, interestingly, the influence of the combination policy on the transient behavior is insignificant, and thus it is more critical to employ policies that enhance the steady-state performance. The theoretical conclusions are illustrated by means of computer simulations.


page 1

page 2

page 3

page 4


Gramian-Based Adaptive Combination Policies for Diffusion Learning over Networks

This paper presents an adaptive combination strategy for distributed lea...

Adaptation in Online Social Learning

This work studies social learning under non-stationary conditions. Altho...

Adaptive Social Learning

This work proposes a novel strategy for social learning by introducing t...

An Anytime Algorithm for Decision Making under Uncertainty

We present an anytime algorithm which computes policies for decision pro...

Verifiable Planning in Expected Reward Multichain MDPs

The planning domain has experienced increased interest in the formal syn...

Influencing Long-Term Behavior in Multiagent Reinforcement Learning

The main challenge of multiagent reinforcement learning is the difficult...

A nearly Blackwell-optimal policy gradient method

For continuing environments, reinforcement learning methods commonly max...

Please sign up or login with your details

Forgot password? Click here to reset