REVIEW 1 cited by
Subsampled R\'enyi Differential Privacy and Analytical Moments Accountant
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
Signed reviews
read the original abstract
We study the problem of subsampling in differential privacy (DP), a question that is the centerpiece behind many successful differentially private machine learning algorithms. Specifically, we provide a tight upper bound on the R\'enyi Differential Privacy (RDP) (Mironov, 2017) parameters for algorithms that: (1) subsample the dataset, and then (2) applies a randomized mechanism M to the subsample, in terms of the RDP parameters of M and the subsampling probability parameter. Our results generalize the moments accounting technique, developed by Abadi et al. (2016) for the Gaussian mechanism, to any subsampled RDP mechanism.
Forward citations
Cited by 1 Pith paper
-
Duet: An Expressive Higher-order Language and Linear Type System for Statically Enforcing Differential Privacy
Duet introduces a linear type system that automatically verifies differential privacy for higher-order programs, supporting multiple modern privacy definitions and per-input privacy accounting, demonstrated on machine...
Discussion (0). Continue with ORCID to comment.