LoRA Soups: Merging LoRAs for Practical Skill Composition Tasks (2025.coling-industry)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is a popular technique for parameter-efficient fine-tuning of Large Language Models. |
| Approach: | They propose to combine LoRA modules to achieve skill composition . they propose to use concatenation of LoRAs to optimize weights for different LoRA training . |
| Outcome: | The proposed model outperforms existing models and data- merging techniques on math-word problems and domain-specialized corpora. |
Similar Papers
Adaptive LoRA Merge with Parameter Pruning for Low-Resource Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for adapting LLMs to low-resource tasks keep LoRA parameters frozen and the low-level problem out of their scope. |
| Approach: | They propose a LoRA merge method that updates and prunes LoRA parameters through fine-tuning with minimal target task data. |
| Outcome: | The proposed method improves performance on a low-resource language generation task and improves on previous methods. |
LoRA-Flow: Dynamic LoRA Fusion for Large Language Models in Generative Tasks (2024.acl-long)
Copied to clipboard
| Challenge: | LoRA-Flow uses lightweight modules to customize large language models for downstream tasks . previous work on LoRA combination relied on task-level weights for each involved LoRA . |
| Approach: | They propose a LoRA-Flow approach that uses dynamic weights to adjust the impact of different LoRAs. |
| Outcome: | The proposed method outperforms baselines with task-level weights on six generative tasks. |
MoRE: A Mixture of Low-Rank Experts for Adaptive Multi-Task Learning (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have revolutionized various domains, offering unprecedented performance across numerous tasks. |
| Approach: | They propose a new Mixture of Low-Rank Experts (MoRE) for multi-task PEFT to improve performance of LLMs with fewer parameters. |
| Outcome: | The proposed method improves performance over multiple tasks and no additional inference cost. |
LoRA on the Go: Instance-level Dynamic LoRA Selection and Merging (2026.acl-long)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is a parameter-efficient approach for fine-tuning large language models. |
| Approach: | They propose a low-rank Adaptation framework that automatically selects and merges LoRA adapters at the instance level without additional training. |
| Outcome: | The proposed framework outperforms training-based baselines on some tasks upto a margin of 3.6% while remaining competitive on other tasks and maintaining inference throughput. |
LoraRetriever: Input-Aware LoRA Retrieval and Composition for Mixed Tasks in the Wild (2024.findings-acl)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is an effective yet efficient solution for fine-tuning large language models. |
| Approach: | They propose a low-rank Adaptation framework that retrieves and composes multiple LoRAs according to input prompts. |
| Outcome: | Experimental results show that LoraRetriever outperforms baselines in terms of performance and versatility. |
How Much Knowledge Can You Pack into a LoRA Adapter without Harming LLM? (2025.findings-naacl)
Copied to clipboard
Sergey Pletenev, Maria Marina, Daniil Moskovskiy, Vasily Konovalov, Pavel Braslavski, Alexander Panchenko, Mikhail Salnikov
| Challenge: | Low-rank adaptation (LoRA) is a popular training technique for updating or domain-specific adaptation of Large Language Models (LLMs). |
| Approach: | They propose to use low-rank adaptation to incorporate new facts into the LLM without compromising previously learned knowledge. |
| Outcome: | The proposed approach is harmful because the model's performance declines after such fine-tuning. |
LoRACoE: Improving Large Language Model via Composition-based LoRA Expert (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies show that the Mixture of Experts architecture improves performance of large language models. |
| Approach: | They propose a method to build static experts using LoRA parameters . they propose to use rank-level parameters to build experts based on rank-based parameters based in LoRA module. |
| Outcome: | The proposed method improves task performance across a broader range of tasks. |
Beyond Full Fine-tuning: Harnessing the Power of LoRA for Multi-Task Instruction Tuning (2024.lrec-main)
Copied to clipboard
Chunlei Xin, Yaojie Lu, Hongyu Lin, Shuheng Zhou, Huijia Zhu, Weiqiang Wang, Zhongyi Liu, Xianpei Han, Le Sun
| Challenge: | Low-Rank Adaptation (LoRA) is a parameter-efficient fine-tuning algorithm for large-scale language models. |
| Approach: | They conduct a systematic study of Low-Rank Adaptation (LoRA) on diverse tasks and rich resources with different learning capacities. |
| Outcome: | The proposed algorithm can achieve remarkable performance in high-resource and multi-task scenarios, even comparable to full fine-tuning. |
MiLoRA: Efficient Mixture of Low-Rank Adaptation for Large Language Models Fine-tuning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Low-rank adaptation and its mixture-of-experts (MOE) methods are highly effective but introduce significant latency in multi-tenant settings due to the LoRA modules and MOE routers added to multiple linear modules. |
| Approach: | They propose a low-rank adaptation variant that considers each LoRA module as an expert and employs a prompt-aware routing mechanism. |
| Outcome: | Extensive analysis on commonsense reasoning tasks and math reasoning tasks show that MiLoRA outperforms strong PEFT baselines with comparable tunable parameter budgets. |
Unraveling LoRA Interference: Orthogonal Subspaces for Robust Model Merging (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning large language models fail due to performance degradation . existing methods fail for models fine- tuned with low-rank adaptation . |
| Approach: | They propose to constrain the LoRA subspace prior to fine-tuning to ensure that updates relevant to one task do not adversely shift outputs for others. |
| Outcome: | The proposed method can integrate with most existing merging algorithms, reducing unintended interference among tasks. |