mlsanityData to 7 Oct 2026

Fine-tuning Large Language Models with Limited Data: A Survey and Practical Guide

arXiv 2411.09539 ↗First posted 14 Nov 2024cs.CL cs.AI cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Fine-tuning large language models (LLMs) with limited data poses a practical challenge in low-resource languages, specialized domains, and constrained deployment settings. While pre-trained LLMs provide strong foundations, effective adaptation under data scarcity requires focused and efficient fine-tuning techniques. This paper presents a structured and practical survey of recent methods for fine-tuning LLMs in data-scarce scenarios. We systematically review parameter-efficient fine-tuning techniques that lower training and deployment costs, domain and cross-lingual adaptation methods for both encoder and decoder models, and model specialization strategies. We further examine preference alignment approaches that guide model behavior using limited human or synthetic feedback, emphasizing sample and compute efficiency. Throughout, we highlight empirical trade-offs, selection criteria, and best practices for choosing suitable techniques based on task constraints, including model scaling, data scaling, and the mitigation of catastrophic forgetting. The aim is to equip researchers and practitioners with actionable insights for effectively fine-tuning LLMs when data and resources are limited.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 175 of its 237 references that are in the map. First posted on arXiv 14 Nov 2024.

Builds on

175 of 237 references.

References · 175

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2022Training language models to follow instructions with human feedbackcited by 15,712
  4. 2017Proximal Policy Optimization Algorithmscited by 14,441
  5. 2024The Llama 3 Herd of Modelscited by 14,192
  6. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  7. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  8. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  9. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  10. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,029
  11. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  12. 2020Scaling Laws for Neural Language Modelscited by 6,411
38 more
  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  2. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  3. 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,907
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  5. 2017Deep reinforcement learning from human preferencescited by 3,846
  6. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  7. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
  8. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,634
  9. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  10. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  11. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  12. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  13. 2022Constitutional AI: Harmlessness from AI Feedbackcited by 2,950
  14. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  15. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
  16. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  17. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  18. 2019Fine-Tuning Language Models from Human Preferencescited by 2,124
  19. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  20. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,973
  21. 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,548
  22. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
  23. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  24. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  25. 2019Cross-lingual Language Model Pretrainingcited by 1,088
  26. 2023LIMA: Less Is More for Alignmentcited by 1,080
  27. 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
  28. 2022Scaling Laws for Reward Model Overoptimizationcited by 1,056
  29. 2024SimPO: Simple Preference Optimization with a Reference-Free Rewardcited by 951
  30. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  31. 2023A General Theoretical Paradigm to Understand Learning from Human Preferencescited by 906
  32. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
  33. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
  34. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  35. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  36. 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 734
  37. 2022Red Teaming Language Models to Reduce Harms: Methods, Scaling Behaviors, and Lessons Learnedcited by 702
  38. 2023RAFT: Reward rAnked FineTuning for Generative Foundation Model Alignmentcited by 672

50 most cited of 175 All 175 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 1.

4 papers.