Decentralized Exploration in Multi-Armed Bandits

11/19/2018
by   Raphael Feraud, et al.
0

We consider the decentralized exploration problem: a set of players collaborate to identify the best arm by asynchronously interacting with the same stochastic environment. The objective is to insure privacy in the best arm identification problem between asynchronous, collaborative, and thrifty players. In the context of a digital service, we advocate that this decentralized approach allows a good balance between the interests of users and those of service providers: the providers optimize their services, while protecting the privacy of the users and saving resources. We define the privacy level as the amount of information an adversary could infer by intercepting the messages concerning a single user. We provide a generic algorithm Decentralized Elimination, which uses any best arm identification algorithm as a subroutine. We prove that this algorithm insures privacy, with a low communication cost, and that in comparison to the lower bound of the best arm identification problem, its sample complexity suffers from a penalty depending on the inverse of the probability of the most frequent players. Finally, we propose an extension of the proposed algorithm to the non-stationary bandits. Experiments illustrate and complete the analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2020

Best-Arm Identification for Quantile Bandits with Privacy

We study the best-arm identification problem in multi-armed bandits with...
research
02/11/2016

Network of Bandits insure Privacy of end-users

In order to distribute the best arm identification task as close as poss...
research
06/13/2020

Explicit Best Arm Identification in Linear Bandits Using No-Regret Learners

We study the problem of best arm identification in linearly parameterise...
research
07/22/2022

SPRT-based Efficient Best Arm Identification in Stochastic Bandits

This paper investigates the best arm identification (BAI) problem in sto...
research
11/14/2021

Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination

This paper investigates the problem of best arm identification in contam...
research
10/27/2021

(Almost) Free Incentivized Exploration from Decentralized Learning Agents

Incentivized exploration in multi-armed bandits (MAB) has witnessed incr...
research
10/15/2020

Stochastic Bandits with Vector Losses: Minimizing ℓ^∞-Norm of Relative Losses

Multi-armed bandits are widely applied in scenarios like recommender sys...

Please sign up or login with your details

Forgot password? Click here to reset