Pith. sign in

REVIEW 4 cited by

Improving Deep Learning with Differential Privacy using Gradient Encoding and Denoising

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 2007.11524 v1 pith:L74ZRJLM submitted 2020-07-22 cs.LG cs.CRstat.ML

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

Signed reviews

No signed human review yet.

0 comments
abstract

Deep learning models leak significant amounts of information about their training datasets. Previous work has investigated training models with differential privacy (DP) guarantees through adding DP noise to the gradients. However, such solutions (specifically, DPSGD), result in large degradations in the accuracy of the trained models. In this paper, we aim at training deep learning models with DP guarantees while preserving model accuracy much better than previous works. Our key technique is to encode gradients to map them to a smaller vector space, therefore enabling us to obtain DP guarantees for different noise distributions. This allows us to investigate and choose noise distributions that best preserve model accuracy for a target privacy budget. We also take advantage of the post-processing property of differential privacy by introducing the idea of denoising, which further improves the utility of the trained models without degrading their DP guarantees. We show that our mechanism outperforms the state-of-the-art DPSGD; for instance, for the same model accuracy of $96.1\%$ on MNIST, our technique results in a privacy bound of $\epsilon=3.2$ compared to $\epsilon=6$ of DPSGD, which is a significant improvement.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. 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.

  2. Structure-Preference Enabled Graph Embedding Generation under Differential Privacy

    stat.ML 2025-01 reject novelty 5.0 of 10

    A private graph embedding method that claims to preserve user-chosen node proximities, though its central proof and privacy analysis contain serious gaps.

  3. AdaDPIGU: Differentially Private SGD with Adaptive Clipping and Importance-Based Gradient Updates for Deep Neural Networks

    cs.LG 2025-07 reject novelty 4.0 of 10

    A DP-SGD variant using top-60% gradient sparsification and coordinate-wise adaptive clipping is proposed; its privacy guarantee is not established for the actual algorithm because the mask comes from private data.

  4. Real-Time Privacy Risk Measurement with Privacy Tokens for Gradient Leakage

    cs.LG 2025-02 reject novelty 4.0 of 10

    The paper introduces privacy tokens, learned gradient embeddings, to estimate mutual information between training data and gradients for real-time privacy risk monitoring during model training.

Pith tools