English

On The Differential Privacy of Thompson Sampling With Gaussian Prior

Cryptography and Security 2018-06-26 v1 Artificial Intelligence Machine Learning

Abstract

We show that Thompson Sampling with Gaussian Prior as detailed by Algorithm 2 in (Agrawal & Goyal, 2013) is already differentially private. Theorem 1 show that it enjoys a very competitive privacy loss of only O(ln2T)\mathcal{O}(\ln^2 T) after T rounds. Finally, Theorem 2 show that one can control the privacy loss to any desirable ϵ\epsilon level by appropriately increasing the variance of the samples from the Gaussian posterior. And this increases the regret only by a term of O(ln2Tϵ)\mathcal{O}(\frac{\ln^2 T}{\epsilon}). This compares favorably to the previous result for Thompson Sampling in the literature ((Mishra & Thakurta, 2015)) which adds a term of O(Kln3Tϵ2)\mathcal{O}(\frac{K \ln^3 T}{\epsilon^2}) to the regret in order to achieve the same privacy level. Furthermore, our result use the basic Thompson Sampling with few modifications whereas the result of (Mishra & Thakurta, 2015) required sophisticated constructions.

Keywords

Cite

@article{arxiv.1806.09192,
  title  = {On The Differential Privacy of Thompson Sampling With Gaussian Prior},
  author = {Aristide C. Y. Tossou and Christos Dimitrakakis},
  journal= {arXiv preprint arXiv:1806.09192},
  year   = {2018}
}

Comments

Accepted in Privacy in Machine Learning and Artificial Intelligence Workshop 2018