mlsanityData to 14 Oct 2026

Differentially Private Zeroth-Order Methods for Scalable Large Language Model Finetuning

arXiv 2402.07818 ↗First posted 12 Feb 2024cs.LG cs.AI cs.CLcited by 14

Not on the map. Why?

Abstract (arXiv)

Fine-tuning on task-specific datasets is a widely-embraced paradigm of harnessing the powerful capability of pretrained LLMs for various downstream tasks. Due to the popularity of LLMs fine-tuning and its accompanying privacy concerns, differentially private (DP) fine-tuning of pretrained LLMs has been widely used to safeguarding the privacy of task-specific datasets. Lying at the design core of DP LLM fine-tuning methods is the satisfactory tradeoff among privacy, utility, and scalability. Most existing methods build upon the seminal work of DP-SGD. Despite pushing the scalability of DP-SGD to its limit, DP-SGD-based fine-tuning methods are unfortunately limited by the inherent inefficiency of SGD. In this paper, we investigate the potential of DP zeroth-order methods for LLM pretraining, which avoids the scalability bottleneck of SGD by approximating the gradient with the more efficient zeroth-order gradient. Rather than treating the zeroth-order method as a drop-in replacement for SGD, this paper presents a comprehensive study both theoretically and empirically. First, we propose the stagewise DP zeroth-order method (DP-ZOSO) that dynamically schedules key hyperparameters. This design is grounded on the synergy between DP random perturbation and the gradient approximation error of the zeroth-order method, and its effect on fine-tuning trajectory. We provide theoretical analysis for both proposed methods. We conduct extensive empirical analysis on both encoder-only masked language model and decoder-only autoregressive language model, achieving impressive results in terms of scalability and utility regardless of the class of tasks (compared with DPZero, DP-ZOPO improves 4.5% on SST-5, 5.5% on MNLI with RoBERTa-Large and 9.2% on CB, 3.9% on BoolQ with OPT-2.7b when ε=4, demonstrates more significant enhancement in performance on more complicated tasks).

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 45 of its 81 references that are in the map. First posted on arXiv 12 Feb 2024.

Builds on

45 of 81 references.

References · 45

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  4. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  5. 2016Deep Learning with Differential Privacycited by 2,728
  6. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  7. 2020Extracting Training Data from Large Language Modelscited by 2,189
  8. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  9. 2019Fine-Tuning Language Models from Human Preferencescited by 2,150
  10. 2015A large annotated corpus for learning natural language inferencecited by 1,847
  11. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
  12. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,317
33 more
  1. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,256
  2. 2020COMET: A Neural Framework for MT Evaluationcited by 1,033
  3. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 864
  4. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 812
  5. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  6. 2023LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attentioncited by 781
  7. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
  8. 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 539
  9. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  10. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  11. 2021Large Language Models Can Be Strong Differentially Private Learnerscited by 412
  12. 2019How to Fine-Tune BERT for Text Classification?cited by 411
  13. 2021Differentially Private Fine-tuning of Language Modelscited by 400
  14. 2023Fine-Tuning Language Models with Just Forward Passescited by 345
  15. 2018Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergencescited by 242
  16. 2018ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehensioncited by 200
  17. 2021Large Scale Private Learning via Low-rank Reparametrizationcited by 88
  18. 2022Automatic Clipping: Differentially Private Deep Learning Made Easier and Strongercited by 88
  19. 2023Flocks of Stochastic Parrots: Differentially Private Prompt Learning for Large Language Modelscited by 83
  20. 2013Fingerprinting Codes and the Price of Approximate Differential Privacycited by 82
  21. 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
  22. 2022Exploring the Limits of Differentially Private Deep Learning with Group-wise Clippingcited by 52
  23. 2021Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settingscited by 45
  24. 2024Private Fine-tuning of Large Language Models with Zeroth-order Optimizationcited by 41
  25. 2018On exponential convergence of SGD in non-convex over-parametrized learningcited by 33
  26. 2022Faster Rates of Convergence to Stationary Points in Differentially Private Optimizationcited by 32
  27. 2023DPZero: Private Fine-Tuning of Language Models without Backpropagationcited by 26
  28. 2021Zeroth-Order Algorithms for Stochastic Distributed Nonconvex Optimizationcited by 13
  29. 2022Differentially Private Model Compressioncited by 13
  30. 2018Universal Stagewise Learning for Non-Convex Problems with Convergence on Averaged Solutionscited by 9
  31. 2022A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimizationcited by 5
  32. 2023Differential Privacy Meets Neural Network Pruningcited by 5
  33. 2023Pre-Pruning and Gradient-Dropping Improve Differentially Private Image Classificationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 8; 2026: 3.

14 papers.

Sort:

By area: