mlsanityData to 7 Oct 2026

Pain-Free Random Differential Privacy with Sensitivity Sampling

arXiv 1706.02562 ↗First posted 8 Jun 2017cs.LG cs.CR cs.DBcited by 7

Not on the map. Why?

Abstract (arXiv)

Popular approaches to differential privacy, such as the Laplace and exponential mechanisms, calibrate randomised smoothing through global sensitivity of the target non-private function. Bounding 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.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Jun 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 0; 2025: 1.

7 papers.