Online learning and adaptation over networks: More information is not necessarily better
Lists
Only you see this
Abstract
We examine the performance of stochastic-gradient learners over connected networks for global optimization problems involving risk functions that are not necessarily quadratic. We consider two well-studied classes of distributed schemes including consensus strategies and diffusion strategies. We quantify how the mean-square-error and the convergence rate of the network vary with the combination policy and with the fraction of informed agents. Several combination policies are considered including doubly-stochastic rules, the averaging rule, Metropolis rule, and the Hastings rule. It will be seen that the performance of the network does not necessarily improve with a larger proportion of informed agents. A strategy to counter the degradation in performance is presented.
BibTeX
@inproceedings{sayed2013online,
author = {Ali H. Sayed and Sheng-Yuan Tu and Jianshu Chen},
title = {{Online learning and adaptation over networks: More information is not necessarily better}},
booktitle = {ITA},
year = {2013},
doi = {10.1109/ita.2013.6502975},
}Loading related content...