SZTE Publicatio Repozitórium (University of Szeged) · 2016 · 40 citations · 18 references
Open access
ComputingComputer ScienceAlgorithmsDistributed SystemsMachine LearningDistributed AlgorithmsDistributed ComputingPeer LearningPeer-to-peer NetworkingPeer-to-peer NetworksPeer-to-peer SystemsBandit AlgorithmsBenchmark DatasetsCommunication CapabilitiesDistributed OptimizationRegret Optimization
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.
18
Stephen Boyd, Aritra Ghosh, Balaji Prabhakar et al. · IEEE Transactions on Information Theory · 2006 · 2.5K citations
A contextual-bandit approach to personalized news article recommendation
Lihong Li, Wei Chu, John Langford et al. · 2010 · 2.5K citations · Full text
Gossip-based computation of aggregate information
David Kempe, Alin Dobra, Johannes Gehrke · 2004 · 1.5K citations
Improved Algorithms for Linear Stochastic Bandits
Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári · 2011 · 916 citations