Pith. sign in

REVIEW 3 cited by

Deep Learning with Gaussian Differential Privacy

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 1911.11607 v3 pith:BU57DJ5Q submitted 2019-11-26 cs.LG cs.CRstat.ML

classification cs.LGcs.CRstat.ML
keywords privacydifferentialnetworksneuralanalysisdeeptrainingcertain
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Deep learning models are often trained on datasets that contain sensitive information such as individuals' shopping transactions, personal contacts, and medical records. An increasingly important line of work therefore has sought to train neural networks subject to privacy constraints that are specified by differential privacy or its divergence-based relaxations. These privacy definitions, however, have weaknesses in handling certain important primitives (composition and subsampling), thereby giving loose or complicated privacy analyses of training neural networks. In this paper, we consider a recently proposed privacy definition termed \textit{$f$-differential privacy} [18] for a refined privacy analysis of training neural networks. Leveraging the appealing properties of $f$-differential privacy in handling composition and subsampling, this paper derives analytically tractable expressions for the privacy guarantees of both stochastic gradient descent and Adam used in training deep neural networks, without the need of developing sophisticated techniques as [3] did. Our results demonstrate that the $f$-differential privacy framework allows for a new privacy analysis that improves on the prior analysis~[3], which in turn suggests tuning certain parameters of neural networks for a better prediction accuracy without violating the privacy budget. These theoretically derived improvements are confirmed by our experiments in a range of tasks in image classification, text classification, and recommender systems. Python code to calculate the privacy cost for these experiments is publicly available in the \texttt{TensorFlow Privacy} library.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Differentially Private Consistent Release of Counting Queries

    cs.IT 2026-07 accept novelty 6.5 of 10

    Closed-form minimum worst-case error and optimal consistent (ε,δ)-DP mechanisms for counting queries are derived, with conditions for no utility loss under cascaded fixed channels and uncoded M-PSK optimality in high privacy.

  2. Synthesizing Probabilistic Saturating Counters with Differentially Private Formal Guarantees

    cs.CR 2026-08 reject novelty 6.0 of 10

    A probabilistic branch-predictor counter with defense parameter p is claimed to satisfy pure differential privacy under Prime+Probe, with p* = 1/(1+e^ε) chosen to minimize misprediction.

  3. Dyn-D$^2$P: Dynamic Differentially Private Decentralized Learning with Provable Utility Guarantee

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Dyn-D2P dynamically adjusts DP noise and gradient clipping in decentralized learning, with a 1/sqrt(n) utility rate on top of an unquantified clipping bias.

Pith tools