Pith. sign in

REVIEW 2 cited by

Avoiding Pitfalls for Privacy Accounting of Subsampled Mechanisms under Composition

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

arxiv 2405.20769 v2 pith:E22G5SXK submitted 2024-05-27 cs.CR cs.DScs.LGstat.ML

classification cs.CRcs.DScs.LGstat.ML
keywords privacyguaranteescompositionsamplingsubsampledmechanismmechanismsparameters
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We consider the problem of computing tight privacy guarantees for the composition of subsampled differentially private mechanisms. Recent algorithms can numerically compute the privacy parameters to arbitrary precision but must be carefully applied. Our main contribution is to address two common points of confusion. First, some privacy accountants assume that the privacy guarantees for the composition of a subsampled mechanism are determined by self-composing the worst-case datasets for the uncomposed mechanism. We show that this is not true in general. Second, Poisson subsampling is sometimes assumed to have similar privacy guarantees compared to sampling without replacement. We show that the privacy guarantees may in fact differ significantly between the two sampling schemes. In particular, we give an example of hyperparameters that result in $\varepsilon \approx 1$ for Poisson subsampling and $\varepsilon > 10$ for sampling without replacement. This occurs for some parameters that could realistically be chosen for DP-SGD.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Private Rate-Constrained Optimization with Applications to Fair Learning

    cs.LG 2025-05 conditional novelty 7.0 of 10

    RaCO-DP is a differentially private SGDA algorithm that enforces arbitrary prediction-rate constraints, such as group fairness and false negative rate limits, using a private histogram per mini-batch while retaining n...

  2. Balls-and-Bins Sampling for DP-SGD

    cs.LG 2024-12 conditional novelty 6.0 of 10

    Balls-and-Bins sampling for DP-SGD has a tight privacy analysis: as private as Poisson at large epsilon, with shuffle-comparable utility, verified by Monte Carlo accounting.

Pith tools