REVIEW 5 cited by
Differentially Private Synthetic Data via Foundation Model APIs 1: Images
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Generating differentially private (DP) synthetic data that closely resembles the original private data is a scalable way to mitigate privacy concerns in the current data-driven world. In contrast to current practices that train customized models for this task, we aim to generate DP Synthetic Data via APIs (DPSDA), where we treat foundation models as blackboxes and only utilize their inference APIs. Such API-based, training-free approaches are easier to deploy as exemplified by the recent surge in the number of API-based apps. These approaches can also leverage the power of large foundation models which are only accessible via their inference APIs. However, this comes with greater challenges due to strictly more restrictive model access and the need to protect privacy from the API provider. In this paper, we present a new framework called Private Evolution (PE) to solve this problem and show its initial promise on synthetic images. Surprisingly, PE can match or even outperform state-of-the-art (SOTA) methods without any model training. For example, on CIFAR10 (with ImageNet as the public data), we achieve FID <= 7.9 with privacy cost {\epsilon} = 0.67, significantly improving the previous SOTA from {\epsilon} = 32. We further demonstrate the promise of applying PE on large foundation models such as Stable Diffusion to tackle challenging private datasets with a small number of high-resolution images. The code and data are released at https://github.com/microsoft/DPSDA.
Forward citations
Cited by 5 Pith papers
-
Minimax optimal differentially private synthetic data for smooth queries
The minimax error for (epsilon,delta)-differentially private synthetic data under k-smooth queries on the d-cube is (n·epsilon)^(-min{1,k/d}) up to log factors, attained by noisy Chebyshev moment matching and matched ...
-
Phantoms and Disclosures: A Statistical Framework for Auditing Privacy in Synthetic Data
A model-agnostic audit detects synthetic data disclosures via feature-match and membership-inference tests that separate true from phantom leaks and give empirical differential-privacy lower bounds.
-
Differentially Private Synthetic Data Release for Topics API Outputs
The paper presents a differentially private methodology and a public synthetic dataset of Topics API traces that match real re-identification risk within one standard deviation on two attacks.
-
Is API Access to LLMs Useful for Generating Private Synthetic Tabular Data?
API access to Gemini 1.0 Pro does not improve differentially private synthetic tabular data beyond established non-LLM baselines on the tested datasets and workloads.
-
How to DP-fy Your Data: A Practical Guide to Generating Synthetic Data With Differential Privacy
A practical, extremely thorough survey of differentially private synthetic data generation: methods, privacy units, evaluation metrics, and end-to-end system components across four data modalities.
Discussion (0). Continue with ORCID to comment.