mlsanityData to 14 Oct 2026

Open LLMs are Necessary for Current Private Adaptations and Outperform their Closed Alternatives

arXiv 2411.05818 ↗First posted 2 Nov 2024cs.LG cs.CRcited by 12

Not on the map. Why?

Abstract (arXiv)

While open Large Language Models (LLMs) have made significant progress, they still fall short of matching the performance of their closed, proprietary counterparts, making the latter attractive even for the use on highly private data. Recently, various new methods have been proposed to adapt closed LLMs to private data without leaking private information to third parties and/or the LLM provider. In this work, we analyze the privacy protection and performance of the four most recent methods for private adaptation of closed LLMs. By examining their threat models and thoroughly comparing their performance under different privacy levels according to differential privacy (DP), various LLM architectures, and multiple datasets for classification and generation tasks, we find that: (1) all the methods leak query data, i.e., the (potentially sensitive) user data that is queried at inference time, to the LLM provider, (2) three out of four methods also leak large fractions of private training data to the LLM provider while the method that protects private data requires a local open LLM, (3) all the methods exhibit lower performance compared to three private gradient-based adaptation methods for local open LLMs, and (4) the private adaptation methods for closed LLMs incur higher monetary training and query costs than running the alternative methods on local open LLMs. This yields the conclusion that, to achieve truly privacy-preserving LLM adaptations that yield high performance and more privacy at lower costs, taking into account current methods and models, one should use open LLMs.

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

Builds on

46 of 65 references.

References · 46

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  6. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  9. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  10. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  11. 2023Mistral 7Bcited by 3,164
  12. 2016Deep Learning with Differential Privacycited by 2,728
34 more
  1. 2020Extracting Training Data from Large Language Modelscited by 2,189
  2. 2018A Call for Clarity in Reporting BLEU Scorescited by 1,799
  3. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  4. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,317
  5. 2021Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivitycited by 1,135
  6. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
  7. 2023DetectGPT: Zero-Shot Machine-Generated Text Detection using Probability Curvaturecited by 726
  8. 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 689
  9. 2019SAMSum Corpus: A Human-annotated Dialogue Dataset for Abstractive Summarizationcited by 535
  10. 2021Large Language Models Can Be Strong Differentially Private Learnerscited by 412
  11. 2021Differentially Private Fine-tuning of Language Modelscited by 400
  12. 2023Detecting Pretraining Data from Large Language Modelscited by 387
  13. 2016Semi-supervised Knowledge Transfer for Deep Learning from Private Training Datacited by 348
  14. 2020Pretrained Transformers Improve Out-of-Distribution Robustnesscited by 294
  15. 2018Scalable Private Learning with PATEcited by 269
  16. 2023Membership Inference Attacks against Language Models via Neighbourhood Comparisoncited by 258
  17. 2019R'enyi Differential Privacy of the Sampled Gaussian Mechanismcited by 204
  18. 2023LoRA Fine-tuning Efficiently Undoes Safety Training in Llama 2-Chat 70Bcited by 195
  19. 2024Stealing Part of a Production Language Modelcited by 159
  20. 2024On Prompt-Driven Safeguarding for Large Language Modelscited by 116
  21. 2021The Efficiency Misnomercited by 98
  22. 2023Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generationcited by 96
  23. 2023Flocks of Stochastic Parrots: Differentially Private Prompt Learning for Large Language Modelscited by 83
  24. 2021On Transferability of Prompt Tuning for Natural Language Processingcited by 75
  25. 2022MPCFormer: fast, performant and private Transformer inference with MPCcited by 69
  26. 2019Learning to Few-Shot Learn Across Diverse Natural Language Classification Taskscited by 57
  27. 2022THE-X: Privacy-Preserving Transformer Inference with Homomorphic Encryptioncited by 57
  28. 2023Privacy-Preserving In-Context Learning for Large Language Modelscited by 50
  29. 2019Practical Differentially Private Top-k Selection with Pay-what-you-get Compositioncited by 39
  30. 2021CaPC Learning: Confidential and Private Collaborative Learningcited by 33
  31. 2023Learning and Forgetting Unsafe Examples in Large Language Modelscited by 24
  32. 2023Privacy-Aware Document Visual Question Answeringcited by 17
  33. 2022A Joint Exponential Mechanism For Differentially Private Top-kcited by 10
  34. 2022Adaptive Private-K-Selection with Adaptive K and Application to Multi-label PATEcited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 7; 2026: 5.

12 papers.