mlsanityData to 14 Oct 2026

LoRASuite: Efficient LoRA Adaptation Across Large Language Model Upgrades

arXiv 2505.13515 ↗First posted 17 May 2025cs.LG cs.AI cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

As Large Language Models (LLMs) are frequently updated, LoRA weights trained on earlier versions quickly become obsolete. The conventional practice of retraining LoRA weights from scratch on the latest model is costly, time-consuming, and environmentally detrimental, particularly as the diversity of LLMs and downstream tasks expands. This motivates a critical question: "How can we efficiently leverage existing LoRA weights to adapt to newer model versions?" To address this, we propose LoRASuite, a modular approach tailored specifically to various types of LLM updates. First, we compute a transfer matrix utilizing known parameters from both old and new LLMs. Next, we allocate corresponding layers and attention heads based on centered kernel alignment and cosine similarity metrics, respectively. A subsequent small-scale, skillful fine-tuning step ensures numerical stability. Experimental evaluations demonstrate that LoRASuite consistently surpasses small-scale vanilla LoRA methods. Notably, on backbone LLMs such as MiniCPM and Qwen, LoRASuite even exceeds the performance of full-scale LoRA retraining, with average improvements of +1.4 and +6.6 points on math tasks, respectively. Additionally, LoRASuite significantly reduces memory consumption by 5.5 GB and computational time by 78.23%.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 49 of its 64 references that are in the map. First posted on arXiv 17 May 2025.

Builds on

49 of 64 references.

References · 49

  1. 2017Attention Is All You Needcited by 60,361
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  5. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  6. 2024Qwen2.5 Technical Reportcited by 4,942
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  8. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  9. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  10. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  11. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  12. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
37 more
  1. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  2. 2013Visualizing and Understanding Convolutional Networkscited by 2,290
  3. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  4. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  5. 2024Qwen2 Technical Reportcited by 2,120
  6. 2019Similarity of Neural Network Representations Revisitedcited by 1,755
  7. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  8. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
  9. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  10. 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 772
  11. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  12. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 724
  13. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
  14. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
  15. 2018What you can cram into a single vector: Probing sentence embeddings for linguistic propertiescited by 457
  16. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  17. 2018Insights on representational similarity in neural networks with canonical correlationcited by 324
  18. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  19. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
  20. 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 245
  21. 2021Training Neural Networks with Fixed Sparse Maskscited by 214
  22. 2023AutoDroid: LLM-powered Task Automation in Androidcited by 184
  23. 2022Analyzing Transformers in Embedding Spacecited by 132
  24. 2024A Practical Review of Mechanistic Interpretability for Transformer-Based Language Modelscited by 118
  25. 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 104
  26. 2024WISE: Rethinking the Knowledge Memory for Lifelong Model Editing of Large Language Modelscited by 92
  27. 2024Knowledge Circuits in Pretrained Transformerscited by 60
  28. 2024Transformer Layers as Painterscited by 54
  29. 2024Understanding the Performance and Estimating the Cost of LLM Fine-Tuningcited by 48
  30. 2022Input-Tuning: Adapting Unfamiliar Inputs to Frozen Pretrained Modelscited by 34
  31. 2023Recyclable Tuning for Continual Pre-trainingcited by 17
  32. 2024MUSCLE: A Model Update Strategy for Compatible LLM Evolutioncited by 15
  33. 2016Post Selection Inference with Kernelscited by 13
  34. 2024textitTrans-LoRA: towards data-free Transferable Parameter Efficient Finetuningcited by 13
  35. 2022Reducing Retraining by Recycling Parameter-Efficient Promptscited by 11
  36. 2023Zero-Shot Continuous Prompt Transfer: Generalizing Task Semantics Across Language Modelscited by 7
  37. 2024PortLLM: Personalizing Evolving Large Language Models with Training-Free and Portable Model Patchescited by 7

Built on by

Cited by year (2026 to 14 Oct)

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

4 papers.