mlsanityData to 14 Oct 2026

Transfer Learning for Finetuning Large Language Models

arXiv 2411.01195 ↗First posted 2 Nov 2024cs.CL cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

As the landscape of large language models expands, efficiently finetuning for specific tasks becomes increasingly crucial. At the same time, the landscape of parameter-efficient finetuning methods rapidly expands. Consequently, practitioners face a multitude of complex choices when searching for an optimal finetuning pipeline for large language models. To reduce the complexity for practitioners, we investigate transfer learning for finetuning large language models and aim to transfer knowledge about configurations from related finetuning tasks to a new task. In this work, we transfer learn finetuning by meta-learning performance and cost surrogate models for grey-box meta-optimization from a new meta-dataset. Counter-intuitively, we propose to rely only on transfer learning for new datasets. Thus, we do not use task-specific Bayesian optimization but prioritize knowledge transferred from related tasks over task-specific feedback. We evaluate our method on eight synthetic question-answer datasets and a meta-dataset consisting of 1,800 runs of finetuning Microsoft's Phi-3. Our transfer learning is superior to zero-shot, default finetuning, and meta-optimization baselines. Our results demonstrate the transferability of finetuning to adapt large language models more effectively.

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

Builds on

26 of 37 references.

References · 26

  1. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  2. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  3. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  4. 2022Emergent Abilities of Large Language Modelscited by 2,512
  5. 2024Qwen2 Technical Reportcited by 2,120
  6. 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,917
  7. 2019PubMedQA: A Dataset for Biomedical Research Question Answeringcited by 1,288
  8. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
  9. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
  10. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
  11. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  12. 2023Fine-Tuning or Retrieval? Comparing Knowledge Injection in LLMscited by 178
14 more
  1. 2020Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learningcited by 174
  2. 2020Training Question Answering Models From Synthetic Datacited by 95
  3. 2024Injecting New Knowledge into Large Language Models via Supervised Fine-Tuningcited by 58
  4. 2023Adapters: A Unified Library for Parameter-Efficient and Modular Transfer Learningcited by 53
  5. 2023AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuningcited by 49
  6. 2023TabRepo: A Large Scale Repository of Tabular Model Evaluations and its AutoML Applicationscited by 33
  7. 2024AutoLoRA: Automatically Tuning Matrix Ranks in Low-Rank Adaptation Based on Meta Learningcited by 31
  8. 2024AutoGluon-Multimodal (AutoMM): Supercharging Multimodal AutoML with Foundation Modelscited by 30
  9. 2017Semi-Supervised QA with Generative Domain-Adaptive Netscited by 27
  10. 2024Learning to Generate Instruction Tuning Datasets for Zero-Shot Task Adaptationcited by 27
  11. 2023LIQUID: A Framework for List Question Answering Dataset Generationcited by 19
  12. 2023Quick-Tune: Quickly Learning Which Pretrained Model to Finetune and Howcited by 18
  13. 2022Zero-Shot AutoML with Pretrained Modelscited by 14
  14. 2023AutoLoRa: A Parameter-Free Automated Robust Fine-Tuning Frameworkcited by 9

Built on by

Cited by year (2026 to 14 Oct)

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

5 papers.