pith. sign in

arxiv: 1812.06210 · v2 · pith:WABINFF2new · submitted 2018-12-15 · 💻 cs.LG · stat.ML

A General Approach to Adding Differential Privacy to Iterative Training Procedures

classification 💻 cs.LG stat.ML
keywords privacytrainingapproachdifferentalgorithmschallengeslearningmechanism
0
0 comments X
read the original abstract

In this work we address the practical challenges of training machine learning models on privacy-sensitive datasets by introducing a modular approach that minimizes changes to training algorithms, provides a variety of configuration strategies for the privacy mechanism, and then isolates and simplifies the critical logic that computes the final privacy guarantees. A key challenge is that training algorithms often require estimating many different quantities (vectors) from the same set of examples --- for example, gradients of different layers in a deep learning architecture, as well as metrics and batch normalization parameters. Each of these may have different properties like dimensionality, magnitude, and tolerance to noise. By extending previous work on the Moments Accountant for the subsampled Gaussian mechanism, we can provide privacy for such heterogeneous sets of vectors, while also structuring the approach to minimize software engineering challenges.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. When Determinants Are Not Enough: Private Rare Switching

    cs.LG 2026-05 unverdicted novelty 5.0

    Replaces determinant growth with generalized Rayleigh quotient for rare switching in private linear bandits to control worst-direction volume despite non-monotonic design matrices from noise.

  2. On Optimal Hyperparameters for Differentially Private Deep Transfer Learning

    cs.LG 2025-10 unverdicted novelty 5.0

    Empirical study of DP transfer learning reveals that larger clipping bounds outperform under tight privacy and cumulative DP noise explains batch-size effects better than existing heuristics.