Achieving Privacy in the Adversarial Multi-Armed Bandit

01/16/2017
by   Aristide C. Y. Tossou, et al.
0

In this paper, we improve the previously best known regret bound to achieve ϵ-differential privacy in oblivious adversarial bandits from O(T^2/3/ϵ) to O(√(T) T /ϵ). This is achieved by combining a Laplace Mechanism with EXP3. We show that though EXP3 is already differentially private, it leaks a linear amount of information in T. However, we can improve this privacy by relying on its intrinsic exponential mechanism for selecting actions. This allows us to reach O(√( T))-DP, with a regret of O(T^2/3) that holds against an adaptive adversary, an improvement from the best known of O(T^3/4). This is done by using an algorithm that run EXP3 in a mini-batch loop. Finally, we run experiments that clearly demonstrate the validity of our theoretical analysis.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset