Distributed Bandit Learning: How Much Communication is Needed to Achieve (Near) Optimal Regret.
http://arxiv.org/abs/1904.06309
@article{DBLP:journals/corr/abs-1904-06309,
author = {Yuanhao Wang and
Jiachen Hu and
Xiaoyu Chen and
Liwei Wang},
title = {Distributed Bandit Learning: How Much Communication is Needed to Achieve
(Near) Optimal Regret},
journal = {CoRR},
volume = {abs/1904.06309},
year = {2019},
url = {http://arxiv.org/abs/1904.06309},
archivePrefix = {arXiv},
eprint = {1904.06309},
timestamp = {Thu, 25 Apr 2019 13:55:01 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-06309.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签