REVIEW 2 cited by
Differentially Private Model Publishing for Deep Learning
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
Deep learning techniques based on neural networks have shown significant success in a wide range of AI tasks. Large-scale training datasets are one of the critical factors for their success. However, when the training datasets are crowdsourced from individuals and contain sensitive information, the model parameters may encode private information and bear the risks of privacy leakage. The recent growing trend of the sharing and publishing of pre-trained models further aggravates such privacy risks. To tackle this problem, we propose a differentially private approach for training neural networks. Our approach includes several new techniques for optimizing both privacy loss and model accuracy. We employ a generalization of differential privacy called concentrated differential privacy(CDP), with both a formal and refined privacy loss analysis on two different data batching methods. We implement a dynamic privacy budget allocator over the course of training to improve model accuracy. Extensive experiments demonstrate that our approach effectively improves privacy loss accounting, training efficiency and model quality under a given privacy budget.
Forward citations
Cited by 2 Pith papers
-
Privacy-Preserving Tensor Factorization for Collaborative Health Data Analysis
DPFact combines elastic averaging SGD, output perturbation under zero-concentrated differential privacy, and l2,1 regularization to enable collaborative tensor factorization for phenotyping from distributed EHRs.
-
AdaCliP: Adaptive Clipping for Private SGD
Coordinate-wise adaptive clipping in DP-SGD, with per-coordinate scales derived from a noise-minimization problem, yields higher MNIST accuracy than standard L2 clipping at the same privacy budget.
Discussion (0). Continue with ORCID to comment.