R2DP: A Universal and Automated Approach to Optimizing the Randomization Mechanisms of Differential Privacy for Utility Metrics with No Known Optimal Distributions
Not on the map. Why?
Abstract (arXiv)
Differential privacy (DP) has emerged as a de facto standard privacy notion for a wide range of applications. Since the meaning of data utility in different applications may vastly differ, a key challenge is to find the optimal randomization mechanism, i.e., the distribution and its parameters, for a given utility metric. Existing works have identified the optimal distributions in some special cases, while leaving all other utility metrics (e.g., usefulness and graph distance) as open problems. Since existing works mostly rely on manual analysis to examine the search space of all distributions, it would be an expensive process to repeat such efforts for each utility metric. To address such deficiency, we propose a novel approach that can automatically optimize different utility metrics found in diverse applications under a common framework. Our key idea that, by regarding the variance of the injected noise itself as a random variable, a two-fold distribution may approximately cover the search space of all distributions. Therefore, we can automatically find distributions in this search space to optimize different utility metrics in a similar manner, simply by optimizing the parameters of the two-fold distribution. Specifically, we define a universal framework, namely, randomizing the randomization mechanism of differential privacy (R2DP), and we formally analyze its privacy and utility. Our experiments show that R2DP can provide better results than the baseline distribution (Laplace) for several utility metrics with no known optimal distributions, whereas our results asymptotically approach to the optimality for utility metrics having known optimal distributions. As a side benefit, the added degree of freedom introduced by the two-fold distribution allows R2DP to accommodate the preferences of both data owners and recipients.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 5; 2025: 1.
8 papers.
- 2024Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference Attackscited by 13
- 2022UniCR: Universally Approximated Certified Robustness via Randomized Smoothingcited by 10
- 2023Label Inference Attack against Split Learning under Regression Settingcited by 7
- 2024Universally Harmonizing Differential Privacy Mechanisms for Federated Learning: Boosting Accuracy and Convergencecited by 1
- 2024S2NeRF: Privacy-preserving Training Framework for NeRFcited by 1
- 2025PLRV-O: Advancing Differentially Private Deep Learning via Privacy Loss Random Variable Optimizationcited by 1
- 2024LMO-DP: Optimizing the Randomization Mechanism for Differentially Private Fine-Tuning (Large) Language Modelscited by 0
- 2024RDP: Ranked Differential Privacy for Facial Feature Protection in Multiscale Sparsified Subspacecited by 0
- 2025PLRV-O: Advancing Differentially Private Deep Learning via Privacy Loss Random Variable Optimization8 Sep 2025
- 2024S2NeRF: Privacy-preserving Training Framework for NeRF3 Sep 2024
- 2024RDP: Ranked Differential Privacy for Facial Feature Protection in Multiscale Sparsified Subspace1 Aug 2024
- 2024Universally Harmonizing Differential Privacy Mechanisms for Federated Learning: Boosting Accuracy and Convergence20 Jul 2024
- 2024LMO-DP: Optimizing the Randomization Mechanism for Differentially Private Fine-Tuning (Large) Language Models29 May 2024
- 2024Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference Attacks4 Mar 2024
- 2023Label Inference Attack against Split Learning under Regression Setting18 Jan 2023
- 2022UniCR: Universally Approximated Certified Robustness via Randomized Smoothing5 Jul 2022