paper-with-me

홈 › Papers

Large Language Models Can Be Strong Differentially Private Learners

2021-10-12 · ICLR 2022 4 · Xuechen Li, Florian Tramèr, Percy Liang, Tatsunori Hashimoto

Differentially Private (DP) learning has seen limited success for building large deep learning models of text, and straightforward attempts at applying Differentially Private Stochastic Gradient Descent (DP-SGD) to NLP tasks have resulted in large performance drops and high computational overhead. We show that this performance drop can be mitigated with (1) the use of large pretrained language models; (2) non-standard hyperparameters that suit DP optimization; and (3) fine-tuning objectives which are aligned with the pretraining procedure. With the above, we obtain NLP models that outperform state-of-the-art DP-trained models under the same privacy budget and strong non-private baselines -- by directly fine-tuning pretrained models with DP optimization on moderately-sized corpora. To address the computational challenge of running DP-SGD with large Transformers, we propose a memory saving technique that allows clipping in DP-SGD to run without instantiating per-example gradients for any linear layer in the model. The technique enables privately training Transformers with almost the same memory cost as non-private training at a modest run-time overhead. Contrary to conventional wisdom that DP optimization fails at learning high-dimensional models (due to noise that scales with dimension) empirical results reveal that private learning with pretrained language models doesn't tend to suffer from dimension-dependent performance degradation. Code to reproduce results can be found at https://github.com/lxuechen/private-transformers.

📄 PDF Abstract BibTeX arXiv:2110.05679

Code (6)

lxuechen/private-transformers 공식 구현 pytorch
facebookresearch/pytorch-dp pytorch
jialinmao/private_cnn pytorch
pytorch/opacus pytorch
woodyx218/SLOPE_AMP
woodyx218/private_vision pytorch

Similar Papers 제목 키워드 기반

Efficient, Noise-Tolerant, and Private Learning via Boosting

2020-02-04 · Mark Bun, Marco Leandro Carmosino, Jessica Sorrell

We introduce a simple framework for designing private boosting algorithms. We give natural conditions under which these algorithms are differentially private, efficient, and noise-tolerant PAC learners. To demonstrate ou…

A Closer Look at the Calibration of Differentially Private Learners

2022-10-15 · HANLIN ZHANG, Xuechen Li, Prithviraj Sen, Salim Roukos 외

We systematically study the calibration of classifiers trained with differentially private stochastic gradient descent (DP-SGD) and observe miscalibration across a wide range of vision and language tasks. Our analysis id…

Data Poisoning against Differentially-Private Learners: Attacks and Defenses

2019-03-23 · Yuzhe Ma, Xiaojin Zhu, Justin Hsu

Data poisoning attacks aim to manipulate the model produced by a learning algorithm by adversarially modifying the training set. We consider differential privacy as a defensive measure against this type of attack. We sho…

Data Poisoning

Multiclass versus Binary Differentially Private PAC Learning

2021-07-22 · NeurIPS 2021 12 · Mark Bun, Marco Gaboardi, Satchit Sivakumar

We show a generic reduction from multiclass differentially private PAC learning to binary private PAC learning. We apply this transformation to a recently proposed binary private PAC learner to obtain a private multiclas…

PAC learning

A Computational Separation between Private Learning and Online Learning

2020-07-11 · NeurIPS 2020 12 · Mark Bun

A recent line of work has shown a qualitative equivalence between differentially private PAC learning and online learning: A concept class is privately learnable if and only if it is online learnable with a finite mistak…

Computational EfficiencyPAC learning