PAC-Private Responses with Adversarial Composition
Xiaochen Zhu, Mayuri Sridhar, Srinivas Devadas

TL;DR
This paper introduces a PAC privacy framework for private model responses, enabling high utility and strong privacy guarantees under adversarial query composition, demonstrated across multiple tasks including vision and NLP.
Contribution
We develop a new adversarial composition algorithm for PAC privacy that ensures mutual information bounds under adaptive, potentially malicious queries.
Findings
Achieves high accuracy with extremely low MI budgets.
Serves one million queries while bounding MIA success to 51.08%.
Distills a privacy-preserving model with 91.86% accuracy on CIFAR-10.
Abstract
Modern machine learning models are increasingly deployed behind APIs. This renders standard weight-privatization methods (e.g. DP-SGD) unnecessarily noisy at the cost of utility. While model weights may vary significantly across training datasets, model responses to specific inputs are much lower dimensional and more stable. This motivates enforcing privacy guarantees directly on model outputs. We approach this under PAC privacy, which provides instance-based privacy guarantees for arbitrary black-box functions by controlling mutual information (MI). Importantly, PAC privacy explicitly rewards output stability with reduced noise levels. However, a central challenge remains: response privacy requires composing a large number of adaptively chosen, potentially adversarial queries issued by untrusted users, where existing composition results on PAC privacy are inadequate. We introduce a…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Adversarial Robustness in Machine Learning · Ethics and Social Impacts of AI
