REVIEW 3 cited by
Scaling up Differentially Private Deep Learning with Fast Per-Example Gradient Clipping
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
read the original abstract
Recent work on Renyi Differential Privacy has shown the feasibility of applying differential privacy to deep learning tasks. Despite their promise, however, differentially private deep networks often lag far behind their non-private counterparts in accuracy, showing the need for more research in model architectures, optimizers, etc. One of the barriers to this expanded research is the training time -- often orders of magnitude larger than training non-private networks. The reason for this slowdown is a crucial privacy-related step called "per-example gradient clipping" whose naive implementation undoes the benefits of batch training with GPUs. By analyzing the back-propagation equations we derive new methods for per-example gradient clipping that are compatible with auto-differentiation (e.g., in PyTorch and TensorFlow) and provide better GPU utilization. Our implementation in PyTorch showed significant training speed-ups (by factors of 54x - 94x for training various models with batch sizes of 128). These techniques work for a variety of architectural choices including convolutional layers, recurrent networks, attention, residual blocks, etc.
Forward citations
Cited by 3 Pith papers
-
Spectral Reach: Understanding Neural Scaling as Progress into the Spectral Tail
Neural scaling occurs because larger models maintain learning on weaker eigenmodes of the eNTK that smaller models cannot access.
-
FlashDP: Private Training Large Language Models with Efficient DP-SGD
FlashDP fuses per-sample gradient computation, norm calculation, clipping, and noise addition into a cache-friendly block-wise all-reduce workflow that avoids explicit per-sample gradient storage and redundant recomputation.
-
Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning
A differentially private linear regression over 50,000 samples is proven inside the RISC Zero ZKVM in under six minutes and verified in 0.17 seconds.
Discussion (0). Sign in to comment.