CLCRLGJul 14, 2021

An Efficient DP-SGD Mechanism for Large Scale NLP Models

arXiv:2107.14586v352 citations
Originality Incremental advance
AI Analysis

This work addresses the need for efficient privacy-preserving training in NLP, particularly for models handling sensitive data, though it is incremental as it builds on existing DP-SGD methods.

The paper tackles the problem of slow training times in differentially private stochastic gradient descent (DP-SGD) for large-scale NLP models, proposing a more efficient variant that achieves faster training with competitive accuracy and improved privacy protection, as evidenced by reduced success in membership inference attacks.

Recent advances in deep learning have drastically improved performance on many Natural Language Understanding (NLU) tasks. However, the data used to train NLU models may contain private information such as addresses or phone numbers, particularly when drawn from human subjects. It is desirable that underlying models do not expose private information contained in the training data. Differentially Private Stochastic Gradient Descent (DP-SGD) has been proposed as a mechanism to build privacy-preserving models. However, DP-SGD can be prohibitively slow to train. In this work, we propose a more efficient DP-SGD for training using a GPU infrastructure and apply it to fine-tuning models based on LSTM and transformer architectures. We report faster training times, alongside accuracy, theoretical privacy guarantees and success of Membership inference attacks for our models and observe that fine-tuning with proposed variant of DP-SGD can yield competitive models without significant degradation in training time and improvement in privacy protection. We also make observations such as looser theoretical $ε, δ$ can translate into significant practical privacy gains.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes