Distributed Clustering of Linear Bandits in Peer to Peer Networks. (arXiv:1604.07706v1 [cs.LG])

We provide two distributed confidence ball algorithms for solving linear bandit problems in peer to peer networks with limited communication capabilities. For the first, we assume that all the peers are solving the same linear bandit problem, and prove that our algorithm achieves the optimal asymptotic regret rate of any centralised algorithm that can instantly communicate information between the peers. For the second, we assume that there are clusters of peers solving the same bandit problem within each cluster, and we prove that our algorithm discovers these clusters, while achieving the optimal asymptotic regret rate within each one. Through experiments on several real-world datasets, we demonstrate the performance of proposed algorithms compared to the state-of-the-art.

Help us improve arXiv so we can better serve you. Take our user survey (survey closes April 27, 8PM EDT).

from cs.AI updates on arXiv.org http://ift.tt/1WoMi7e
via IFTTT