We study the interplay between communication and feedback in a cooperative online learning setting, where a network of communicating agents learn a common sequential decision-making task through a feedback graph. We bound the network regret in terms of the independence number of the strong product between the communication network and the feedback graph. Our analysis recovers as special cases many previously known bounds for cooperative online learning with expert or bandit feedback. We also prove an instance-based lower bound, demonstrating that our positive results are not improvable except in pathological cases. Experiments on synthetic data confirm our theoretical findings.

If you use or study any part of this repository, please cite it as:

@article{cesa2021cooperative,
title={Cooperative online learning with feedback graphs},
author={Cesa-Bianchi, Nicol{\`o} and Cesari, Tommaso R and Della Vecchia, Riccardo},
journal={arXiv preprint arXiv:2106.04982},
year={2021}
}