Optimal Aggregation Strategies for Social Learning over Graphs
Abstract
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 steady-state error probability 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 low 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.
Cite
@article{arxiv.2203.07065,
title = {Optimal Aggregation Strategies for Social Learning over Graphs},
author = {Ping Hu and Virginia Bordignon and Stefan Vlaski and Ali H. Sayed},
journal= {arXiv preprint arXiv:2203.07065},
year = {2023}
}