mlsanityData to 14 Oct 2026

Understanding Overadaptation in Supervised Fine-Tuning: The Role of Ensemble Methods

arXiv 2506.01901 ↗First posted 2 Jun 2025cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Supervised fine-tuning (SFT) on domain-specific data is the dominant approach for adapting foundation models to specialized tasks. However, it has been observed that SFT models tend to forget knowledge acquired during pretraining. In vision models, ensembling a pretrained model with its fine-tuned counterpart has been shown to mitigate this issue. In this work, we demonstrate that the same holds for language models, and, more strikingly, we observe an overadaptation phenomenon: the ensemble model not only retains general knowledge from the foundation model but also outperforms the fine-tuned model even on the fine-tuning domain itself. Despite the empirical success of ensembling, a theoretical understanding of its benefits remains underexplored. We develop a formal theoretical analysis of the overadaptation phenomenon. Ensembling mitigates this by balancing two primary sources of error: bias, caused by insufficient fine-tuning, and variance, introduced by overfitting to fine-tuning data. While regularization techniques aim to address this trade-off, we show that ensembling provides a more effective solution. We analyze this phenomenon in over-parameterized linear settings and demonstrate that interpolating between pretrained and fine-tuned weights significantly improves performance. These findings offer theoretical justification for the observed advantages of model ensembling, supported by empirical experiments consistent with our analysis.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 22 of its 47 references that are in the map. First posted on arXiv 2 Jun 2025.

Builds on

22 of 47 references.

References · 22

  1. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  2. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  3. 2021Robust fine-tuning of zero-shot modelscited by 797
  4. 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
  5. 2023PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallelcited by 660
  6. 2019Benign Overfitting in Linear Regressioncited by 549
  7. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
  8. 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 297
  9. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
  10. 2023Mitigating the Alignment Tax of RLHFcited by 183
  11. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  12. 2021Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalizationcited by 144
10 more
  1. 2024Why Transformers Need Adam: A Hessian Perspectivecited by 124
  2. 2021Continual Learning for Text Classification with Information Disentanglement Based Regularizationcited by 86
  3. 2020Spectra of the Conjugate Kernel and Neural Tangent Kernel for linear-width neural networkscited by 77
  4. 2023Trainable Projected Gradient Method for Robust Fine-tuningcited by 37
  5. 2022Benign, Tempered, or Catastrophic: A Taxonomy of Overfittingcited by 36
  6. 2022Calibrated ensembles can mitigate accuracy tradeoffs under distribution shiftcited by 34
  7. 2023On the Eigenvalue Decay Rates of a Class of Neural-Network Related Kernel Functions Defined on General Domainscited by 31
  8. 2023Spurious Feature Diversification Improves Out-of-distribution Generalizationcited by 26
  9. 2022Sobolev Acceleration and Statistical Optimality for Learning Elliptic Equations via Gradient Descentcited by 11
  10. 2024On the Benefits of Over-parameterization for Out-of-Distribution Generalizationcited by 7

Built on by

Cited by year (2026 to 14 Oct)

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

9 papers.