General-Purpose f-DP Estimation and Auditing in a Black-Box Setting
Not on the map. Why?
Abstract (arXiv)
In this paper we propose new methods to statistically assess f-Differential Privacy (f-DP), a recent refinement of differential privacy (DP) that remedies certain weaknesses of standard DP (including tightness under algorithmic composition). A challenge when deploying differentially private mechanisms is that DP is hard to validate, especially in the black-box setting. This has led to numerous empirical methods for auditing standard DP, while f-DP remains less explored. We introduce new black-box methods for f-DP that, unlike existing approaches for this privacy notion, do not require prior knowledge of the investigated algorithm. Our procedure yields a complete estimate of the f-DP trade-off curve, with theoretical guarantees of convergence. Additionally, we propose an efficient auditing method that empirically detects f-DP violations with statistical certainty, merging techniques from non-parametric estimation and optimal classification theory. Through experiments on a range of DP mechanisms, we demonstrate the effectiveness of our estimation and auditing procedures.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Feb 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025The Hitchhiker's Guide to Efficient, End-to-End, and Tight DP Auditingcited by 5
- 2026Sequential Auditing for f-Differential Privacycited by 0
- 2026When Are Trade-Off Functions Testable from Finite Samples?cited by 0
- 2026Let's Ask Gauss: Improved One-Run Privacy Auditingcited by 0
- 2026Let's Ask Gauss: Improved One-Run Privacy Auditing10 Jun 2026
- 2026When Are Trade-Off Functions Testable from Finite Samples?11 May 2026
- 2026Sequential Auditing for f-Differential Privacy6 Feb 2026
- 2025The Hitchhiker's Guide to Efficient, End-to-End, and Tight DP Auditing20 Jun 2025