mlsanityData to 13 Oct 2026

LoRE-Merging: Exploring Low-Rank Estimation For Large Language Model Merging

arXiv 2502.10749 ↗First posted 15 Feb 2025cs.CL cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

While most current approaches rely on further training techniques, such as fine-tuning or reinforcement learning, to enhance model capacities, model merging stands out for its ability of improving models without requiring any additional training. In this paper, we propose a unified framework for model merging based on low-rank estimation of task vectors without the need for access to the base model, named textscLoRE-Merging. Our approach is motivated by the observation that task vectors from fine-tuned models frequently exhibit a limited number of dominant singular values, making low-rank estimations less prone to interference. We implement the method by formulating the merging problem as an optimization problem. Extensive empirical experiments demonstrate the effectiveness of our framework in mitigating interference and preserving task-specific information, thereby advancing the state-of-the-art performance in model merging techniques.

Key facts. Cited by 7 papers in the map (data through 13 Oct 2026). Builds on 29 of its 37 references that are in the map. First posted on arXiv 15 Feb 2025.

Builds on

29 of 37 references.

References · 29

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,916
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,091
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,270
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,880
  5. 2021On the Opportunities and Risks of Foundation Modelscited by 3,999
  6. 2021Program Synthesis with Large Language Modelscited by 3,573
  7. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,384
  8. 2024Qwen2.5-Coder Technical Reportcited by 1,179
  9. 2019A Comprehensive Survey on Transfer Learningcited by 1,157
  10. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 687
  11. 2023WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instructcited by 621
  12. 2021Merging Models with Fisher-Weighted Averagingcited by 617
17 more
  1. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 586
  2. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
  3. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
  4. 2015Coordinate Descent Algorithmscited by 218
  5. 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 189
  6. 2021Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalizationcited by 144
  7. 2023NL4Opt Competition: Formulating Optimization Problems Based on Their Natural Language Descriptionscited by 134
  8. 2024ORLM: A Customizable Framework in Training Large Models for Automated Optimization Modelingcited by 124
  9. 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 115
  10. 2022Fusing finetuned models for better pretrainingcited by 110
  11. 2020Stochastic Weight Averaging in Parallel: Large-Batch Training that Generalizes Wellcited by 57
  12. 2022ColD Fusion: Collaborative Descent for Distributed Multitask Finetuningcited by 52
  13. 2024LoRA Soups: Merging LoRAs for Practical Skill Composition Taskscited by 51
  14. 2024LoRA Training in the NTK Regime has No Spurious Local Minimacited by 48
  15. 2024Determine-Then-Ensemble: Necessity of Top-k Union for Large Language Model Ensemblingcited by 28
  16. 2024Checkpoint Merging via Bayesian Optimization in LLM Pretrainingcited by 27
  17. 2023Exploring Continual Learning for Code Generation Modelscited by 22

Built on by

Cited by year (2026 to 13 Oct)

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

7 papers.