mlsanityData to 7 Oct 2026

Selective Self-Rehearsal: A Fine-Tuning Approach to Improve Generalization in Large Language Models

arXiv 2409.04787 ↗First posted 7 Sep 2024cs.CL cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Fine-tuning Large Language Models (LLMs) on specific datasets is a common practice to improve performance on target tasks. However, this performance gain often leads to overfitting, where the model becomes too specialized in either the task or the characteristics of the training data, resulting in a loss of generalization. This paper introduces Selective Self-Rehearsal (SSR), a fine-tuning approach that achieves performance comparable to the standard supervised fine-tuning (SFT) while improving generalization. SSR leverages the fact that there can be multiple valid responses to a query. By utilizing the model's correct responses, SSR reduces model specialization during the fine-tuning stage. SSR first identifies the correct model responses from the training set by deploying an appropriate LLM as a judge. Then, it fine-tunes the model using the correct model responses and the gold response for the remaining samples. The effectiveness of SSR is demonstrated through experiments on the task of identifying unanswerable queries across various datasets. The results show that standard SFT can lead to an average performance drop of up to 16.7% on multiple benchmarks, such as MMLU and TruthfulQA. In contrast, SSR results in close to 2% drop on average, indicating better generalization capabilities compared to standard SFT.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 42 references that are in the map. First posted on arXiv 7 Sep 2024.

Builds on

27 of 42 references.

References · 27

  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. 2023GPT-4 Technical Reportcited by 18,132
  4. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  6. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  7. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  8. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
  9. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  10. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  11. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
  12. 2020Learning to summarize from human feedbackcited by 2,562
15 more
  1. 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
  2. 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,304
  3. 2018Experience Replay for Continual Learningcited by 1,074
  4. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
  5. 2023Extracting Training Data from Diffusion Modelscited by 723
  6. 2021Cross-Task Generalization via Natural Language Crowdsourcing Instructionscited by 696
  7. 2019Dreaming to Distill: Data-free Knowledge Transfer via DeepInversioncited by 419
  8. 2023Poisoning Language Models During Instruction Tuningcited by 254
  9. 2019REMIND Your Neural Network to Prevent Catastrophic Forgettingcited by 197
  10. 2019To Tune or Not to Tune? Adapting Pretrained Representations to Diverse Taskscited by 167
  11. 2019Revisiting Self-Training for Neural Sequence Generationcited by 154
  12. 2021Always Be Dreaming: A New Approach for Data-Free Class-Incremental Learningcited by 130
  13. 2019Learning and Evaluating General Linguistic Intelligencecited by 78
  14. 2021MultiDoc2Dial: Modeling Dialogues Grounded in Multiple Documentscited by 53
  15. 2020Neural Learning of One-of-Many Solutions for Combinatorial Problems in Structured Output Spacescited by 12

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.