Online Sensitivity Optimization in Differentially Private Learning
Filippo Galli, Catuscia Palamidessi, Tommaso Cucinotta

TL;DR
This paper introduces a dynamic method to optimize the gradient clipping threshold in differentially private learning, reducing the need for extensive hyperparameter tuning and improving model utility under privacy constraints.
Contribution
We propose a novel approach that treats the clipping threshold as a learnable parameter, enabling gradient-based optimization with minimal privacy impact.
Findings
Our method performs comparably or better than fixed strategies across various datasets.
It reduces the need for costly hyperparameter tuning.
It maintains privacy guarantees while improving model utility.
Abstract
Training differentially private machine learning models requires constraining an individual's contribution to the optimization process. This is achieved by clipping the -norm of their gradient at a predetermined threshold prior to averaging and batch sanitization. This selection adversely influences optimization in two opposing ways: it either exacerbates the bias due to excessive clipping at lower values, or augments sanitization noise at higher values. The choice significantly hinges on factors such as the dataset, model architecture, and even varies within the same optimization, demanding meticulous tuning usually accomplished through a grid search. In order to circumvent the privacy expenses incurred in hyperparameter tuning, we present a novel approach to dynamically optimize the clipping threshold. We treat this threshold as an additional learnable parameter, establishing a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Stochastic Gradient Optimization Techniques · Adversarial Robustness in Machine Learning
