Quantifying identifiability to choose and audit $\epsilon$ in differentially private deep learning
Daniel Bernau, G\"unther Eibl, Philip W. Grassal, Hannah Keller,, Florian Kerschbaum

TL;DR
This paper introduces a method to quantify and audit the identifiability of data records in differentially private deep learning models, providing practical tools for choosing privacy parameters aligned with societal norms.
Contribution
It transforms differential privacy parameters into bounds on adversarial belief, enabling empirical auditing and tighter privacy-utility trade-offs in deep learning.
Findings
Bound on Bayesian posterior belief for privacy loss
Empirical identifiability scores for models
Tightness of bounds in practice
Abstract
Differential privacy allows bounding the influence that training data records have on a machine learning model. To use differential privacy in machine learning, data scientists must choose privacy parameters . Choosing meaningful privacy parameters is key, since models trained with weak privacy parameters might result in excessive privacy leakage, while strong privacy parameters might overly degrade model utility. However, privacy parameter values are difficult to choose for two main reasons. First, the theoretical upper bound on privacy loss might be loose, depending on the chosen sensitivity and data distribution of practical datasets. Second, legal requirements and societal norms for anonymization often refer to individual identifiability, to which are only indirectly related. We transform to a bound on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security
