English

Efficient Per-Example Gradient Computations in Convolutional Neural Networks

Machine Learning 2020-11-17 v1 Computer Vision and Pattern Recognition Machine Learning

Abstract

Deep learning frameworks leverage GPUs to perform massively-parallel computations over batches of many training examples efficiently. However, for certain tasks, one may be interested in performing per-example computations, for instance using per-example gradients to evaluate a quantity of interest unique to each example. One notable application comes from the field of differential privacy, where per-example gradients must be norm-bounded in order to limit the impact of each example on the aggregated batch gradient. In this work, we discuss how per-example gradients can be efficiently computed in convolutional neural networks (CNNs). We compare existing strategies by performing a few steps of differentially-private training on CNNs of varying sizes. We also introduce a new strategy for per-example gradient calculation, which is shown to be advantageous depending on the model architecture and how the model is trained. This is a first step in making differentially-private training of CNNs practical.

Keywords

Cite

@article{arxiv.1912.06015,
  title  = {Efficient Per-Example Gradient Computations in Convolutional Neural Networks},
  author = {Gaspar Rochette and Andre Manoel and Eric W. Tramel},
  journal= {arXiv preprint arXiv:1912.06015},
  year   = {2020}
}
R2 v1 2026-06-23T12:44:12.810Z