A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Distributed Differential Privacy in Multi-Armed Bandits
[article]
2022
arXiv
pre-print
We consider the standard K-armed bandit problem under a distributed trust model of differential privacy (DP), which enables to guarantee privacy without a trustworthy server. Under this trust model, previous work largely focus on achieving privacy using a shuffle protocol, where a batch of users data are randomly permuted before sending to a central server. This protocol achieves (ϵ,δ) or approximate-DP guarantee by sacrificing an additional additive O(Klog T√(log(1/δ))/ϵ) cost in T-step
arXiv:2206.05772v1
fatcat:7haeuzzcbvgztngnymioayqike