mlsanityData to 7 Oct 2026

The Appeal and Reality of Recycling LoRAs with Adaptive Merging

arXiv 2602.12323 ↗First posted 12 Feb 2026cs.LG cs.SEcited by 2

Not on the map. Why?

Abstract (arXiv)

The widespread availability of fine-tuned LoRA modules for open pre-trained models has led to an interest in methods that can adaptively merge LoRAs to improve performance. These methods typically include some way of selecting LoRAs from a pool and tune merging coefficients based on a task-specific dataset. While adaptive merging methods have demonstrated improvements in some settings, no past work has attempted to recycle LoRAs found "in the wild" on model repositories like the Hugging Face Hub. To address this gap, we consider recycling from a pool of nearly 1,000 user-contributed LoRAs trained from the Llama 3.1 8B-Instruct language model. Our empirical study includes a range of adaptive and non-adaptive merging methods in addition to a new method designed via a wide search over the methodological design space. We demonstrate that adaptive merging methods can improve performance over the base model but provide limited benefit over training a new LoRA on the same data used to set merging coefficients. We additionally find not only that the specific choice of LoRAs to merge has little importance, but that using LoRAs with randomly initialized parameter values yields similar performance. This raises the possibility that adaptive merging from recycled LoRAs primarily works via some kind of regularization effect, rather than by enabling positive cross-task transfer. To better understand why past work has proven successful, we confirm that positive transfer is indeed possible when there are highly relevant LoRAs in the pool. We release the model checkpoints and code online.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 53 of its 63 references that are in the map. First posted on arXiv 12 Feb 2026.

Builds on

53 of 63 references.

References · 53

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2025Qwen3 Technical Reportcited by 8,195
  4. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  6. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  7. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  8. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  9. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  10. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
  11. 2025Gemma 3 Technical Reportcited by 1,686
  12. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
38 more
  1. 2022Editing Models with Task Arithmeticcited by 1,076
  2. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
  3. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
  4. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  5. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  6. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
  7. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 642
  8. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
  9. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  10. 2021Merging Models with Fisher-Weighted Averagingcited by 613
  11. 2017Learning multiple visual domains with residual adapterscited by 553
  12. 2022Large Language Models Struggle to Learn Long-Tail Knowledgecited by 452
  13. 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 359
  14. 2024LoRA Learns Less and Forgets Lesscited by 313
  15. 2019QASC: A Dataset for Question Answering via Sentence Compositioncited by 248
  16. 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
  17. 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 231
  18. 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
  19. 2024OpenMathInstruct-2: Accelerating AI for Math with Massive Open-Source Instruction Datacited by 194
  20. 2024Mixture of LoRA Expertscited by 179
  21. 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 143
  22. 2020Intermediate-Task Transfer Learning with Pretrained Models for Natural Language Understanding: When and Why Does It Work?cited by 127
  23. 2020Exploring and Predicting Transferability across NLP Taskscited by 126
  24. 2022Fusing finetuned models for better pretrainingcited by 110
  25. 2023AdapterSoup: Weight Averaging to Improve Generalization of Pretrained Language Modelscited by 84
  26. 2024Towards Modular LLMs by Building and Reusing a Library of LoRAscited by 72
  27. 2023Knowledge is a Region in Weight Space for Fine-tuned Language Modelscited by 58
  28. 2025Command A: An Enterprise-Ready Large Language Modelcited by 57
  29. 2024A Survey on Model MoErging: Recycling and Routing Among Specialized Experts for Collaborative Learningcited by 52
  30. 2023π-Tuning: Transferring Multimodal Foundation Models with Optimal Multi-task Interpolationcited by 40
  31. 2019Automatically Identifying Complaints in Social Mediacited by 25
  32. 2025We Should Chart an Atlas of All the World's Modelscited by 25
  33. 2023unarXive 2022: All arXiv Publications Pre-Processed for NLP, Including Structured Full-Text and Citation Networkcited by 24
  34. 2021Identifying Machine-Paraphrased Plagiarismcited by 16
  35. 2024MeteoRA: Multiple-tasks Embedded LoRA for Large Language Modelscited by 14
  36. 2025Fishers for Free? Approximating the Fisher Information Matrix by Recycling the Squared Gradient Accumulatorcited by 13
  37. 2024Realistic Evaluation of Model Merging for Compositional Generalizationcited by 12
  38. 2025The Butterfly Effect: Neural Network Training Trajectories Are Highly Sensitive to Initial Conditionscited by 9

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.