资源论文Pain-Free Random Differential Privacy with Sensitivity Sampling

Pain-Free Random Differential Privacy with Sensitivity Sampling

2020-03-09 | |  70 |   39 |   0

Abstract

Popular approaches to differential privacy, such as the Laplace and exponential mechanisms, calibrate randomised smoothing through global sensitivity of the target non-private function. Bound ing such sensitivity is often a prohibitively complex analytic calculation. As an alternative, we propose a straightforward sampler for estimating sensitivity of non-private mechanisms. Since our sensitivity estimates hold with high probability, any mechanism that would be (ε,δ) differentially private under bounded global sensitivity automatically achieves (ε,δ,γ)-random differential privacy (Hall et al., 2012), without any target-specific calculations required. We demonstrate on worked example learners how our usable approach adopts a naturally-relaxed privacy guarantee, while achieving more accurate releases even for non-private functions that are black-box computer programs.

上一篇:MEC: Memory-efficient Convolution for Deep Neural Network

下一篇:Parseval Networks: Improving Robustness to Adversarial Examples

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...