Challenge: Existing LoRA selection methods rely on a few task samples, making it difficult to capture full scope of task-relevant information.
Approach: They propose a framework that selects appropriate LoRA modules and aggregates them using a convolutional LoRA aggregator.
Outcome: The proposed framework bridges the knowledge gap between selected modules and target task . it ensures comprehensive coverage of task-relevant LoRA modules .

Similar Papers

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.
RB-LoRA: Rank-Balanced Aggregation for Low-Rank Adaptation with Federated Fine-Tuning (2026.findings-eacl)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) improves fine-tuning of foundation models by updating only compact adapter matrices . varying client device capabilities lead to different adapter ranks, causing rank heterogeneity that undermines aggregation.
Approach: They propose a rank-balanced aggregation framework that decomposes each update into rank-wise components and aligns them using analytically derived weights.
Outcome: Experiments on language and vision models show that RB-LoRA improves under one and three rounds of communication in federated learning environments.
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 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.
SAMoRA: Semantic-Aware Mixture of LoRA Experts for Task-Adaptive Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for multitask learning fail to match input semantics with expert capabilities, leading to weak expert specialization.
Approach: They propose a parameter-efficient mixture-of-experts framework for task-adaptive learning that aligns textual semantics with the most suitable experts for precise routing.
Outcome: The proposed framework outperforms the state-of-the-art methods and holds excellent task generalization capabilities.
MoSLD: An Extremely Parameter-Efficient Mixture-of-Shared LoRAs for Multi-Task Learning (2025.coling-main)

Copied to clipboard

Challenge: LoRA is a key technique for fine-tuning large pre-trained models, yet its performance in multi-task learning scenarios often falls short.
Approach: They propose a mixture-of-shared-LoRAs model with a dropout strategy . they propose to share the upper projection matrix among different experts .
Outcome: The proposed model exhibits excellent performance in both single-task and multi-task scenarios with robust out-of-domain generalization capabilities.
LoRA-drop: Efficient LoRA Parameter Pruning based on Output Evaluation (2025.coling-main)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is currently the most commonly used PEFT method for fine-tuning models with billions of parameters.
Approach: They propose to use low-rank Adaptation to evaluate LoRA parameter features and then retain LoRA for important layers and the other layers share the same LoRA.
Outcome: The proposed method achieves comparable performance to full fine-tuning and LoRA while retaining 50% of the LoRA parameters on average.
pFedGPT: Hierarchically Optimizing LoRA Aggregation Weights for Personalized Federated GPT Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning Large Language Models (LLMs) struggle with data heterogeneity and adapt shared global knowledge to individual client needs.
Approach: They propose a framework that leverages Hierarchical Bayesian Optimization (HBO) for fine-grained, personalized LoRA aggregation.
Outcome: The proposed framework achieves state-of-the-art (SOTA) performance on personalized FL benchmarks while introducing only minimal (approx. 4%) additional optimization overhead.
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.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations