Challenge: Low-Rank Adaptation (LoRA) improves performance in multi-task learning by diversifying the head matrices through Multi-Head Dropout and Multi-head Random Initialization.
Approach: They propose a low-rank adaptive approach to fine-tune large language models by approximating weight updates through low-ranked matrices.
Outcome: The proposed approach improves performance in multi-task learning while reducing memory usage and training time.

Similar Papers

Beyond Full Fine-tuning: Harnessing the Power of LoRA for Multi-Task Instruction Tuning (2024.lrec-main)

Copied to clipboard

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.
Fast Randomized Low-Rank Adaptation of Pre-trained Language Models with PAC Regularization (2024.findings-acl)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is an efficient way to fine-tune large language models (LLMs) but its memory overhead restricts it to scale up when the model size increases.
Approach: They propose a low-rank adaptation method which decomposes model weight updates into a pair of low-ranked projection matrices and incorporates a regularizer to improve generalization.
Outcome: The proposed method achieves better performance under few-shot settings and similar performance to the SOTA low-rank adaptation methods.
Sensitivity-LoRA : Low-Load Sensitivity-Based Fine-Tuning for Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is a promising approach to adapting LLMs to specialized tasks . existing rank allocation techniques remain computationally inefficient and unstable .
Approach: They propose a low-rank adapted model that approximates model weight updates using low-ranked decomposition.
Outcome: The proposed method is limited by its uniform rank allocation to each incremental matrix . it leverages the second-order derivatives of the loss function to capture weight sensitivity .
NormAL LoRA: What is the perfect size? (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are crucial for enabling intelligent experiences across applications.
Approach: They propose a low-rank adaptive localization method that uses rank-norm regularization to determine the optimal rank for each weight matrix.
Outcome: NormAL LoRA reduces adapter parameters by 37% while preserving full fine-tuning performance.
G-LoRA: Global-Local Decoupled Low-Rank Adaptation (2026.findings-acl)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) improves the fine-tuning efficiency and performance of large language models.
Approach: They propose a low-rank adaptive approach that decomposes update matrix into global and local adapters and assigns them to local and global adapters.
Outcome: The proposed method achieves up to 2.7% accuracy improvement over LoRA and its variants on commonsense reasoning, mathematical reasoning, and code generation.
RA-LoRA: Rank-Adaptive Parameter-Efficient Fine-Tuning for Accurate 2-bit Quantized Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) with their extensive parameters and high memory demands are challenging to fine-tune for specific applications with limited resources.
Approach: They propose a method that dynamically adjusts the adapter’s rank using rank-subspace analysis, optimizing performance with fewer parameters.
Outcome: The proposed method improves model accuracy with minimal parameter changes and demonstrates the importance of rank dynamics in optimizing quantized LLMs.
GeLoRA: Geometric Adaptive Ranks For Efficient LoRA Fine-tuning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing adaptive LoRA methods lack a theoretical foundation to guide this trade-off optimally.
Approach: They propose a principled approach that estimates the intrinsic dimensionality of hidden data representations to adaptively select LoRA ranks.
Outcome: Experiments show that GeLoRA outperforms adaptive LoRA methods by up to +1.0% .
META-LORA: Memory-Efficient Sample Reweighting for Fine-Tuning Large Language Models (2025.coling-main)

Copied to clipboard

Challenge: Supervised fine-tuning (SFT) is widely adopted for tailoring large language models (LLMs) to specific downstream tasks.
Approach: They propose a memory-efficient method for automatic sample reweighting that learns to re-weight fine-tuning samples by minimizing the loss on a small, high-quality validation set.
Outcome: Meta-LoRA learns to reweight fine-tuning samples by minimizing the loss on a small, high-quality validation set through an end-to-end bi-level optimization framework based on meta-learning.
DenseLoRA: Dense Low-Rank Adaptation of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is an efficient approach for adapting large language models (LLMs) but many of the weights in these matrices are redundant, leading to inefficiencies in parameter utilization.
Approach: They propose a low-rank adaptation approach that fine-tunes two low-ranked matrices and adapts them through a dense low-Rank matrix, improving parameter utilization and adaptation efficiency.
Outcome: The proposed approach achieves 83.8% accuracy with only 0.01% of trainable parameters compared to LoRA's 80.8% with 0.70% of trainability parameters on LLaMA3-8B.
TLoRA: Task-aware Low Rank Adaptation of Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing low-rank Adaptation (LoRA) methods address only one factor, often at the cost of increased training complexity or reduced practical efficiency.
Approach: They propose a low-rank Adaptation framework that optimizes initialization and resource allocation at the outset of training.
Outcome: The proposed framework performs excellently across various tasks while reducing the number of trainable parameters.

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