Challenge: Low-Rank Adaptation (LoRA) is a widely used method to fine-tune large language models . but its fixed-rank design cannot capture the varying importance across different layers .
Approach: They propose a framework that bi-directionally reallocates low-rank capacity using Hebbian-inspired importance estimation.
Outcome: Experiments show that HeBiRA improves performance over baselines.

Similar Papers

BeamLoRA: Beam-Constraint Low-Rank Adaptation (2025.acl-long)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is one of the most efficient parameter-efficient fine-tuning methods.
Approach: They propose to conceptualize each LoRA module as a beam where each rank corresponds to a potential sub-solution.
Outcome: The proposed method improves performance on three base models and 12 datasets.
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.
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 .
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.
ALoRA: Allocating Low-Rank Adaptation for Fine-tuning Large Language Models (2024.naacl-long)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) has demonstrated commendable performance as a popular method . however, it is implemented with a fixed intrinsic rank that might not be ideal for downstream tasks.
Approach: They propose a method that estimates the importance score of each LoRA rank and prunes abundant LoRA ranks to improve performance.
Outcome: The proposed method outperforms baselines on a variety of tasks with comparable parameters.
Not All Directions Matter: Towards Structured and Task-Aware Low-Rank Model Adaptation (2026.acl-long)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is a key parameter-efficient fine-tuning method . however, its effectiveness is hampered by semantic drift and structural incoherence .
Approach: They propose a low-rank Adaptation framework that tackles semantic drift and structural incoherence by pruning task-irrelevant directions.
Outcome: Experiments on large language models, vision models, and vision models show that the proposed framework outperforms LoRA and advanced dynamic rank allocation and sparsity-based methods.
Towards Federated Low-Rank Adaptation of Language Models with Rank Heterogeneity (2025.naacl-short)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is an efficient alternative to full-weight adaptation in federated fine-tuning of language models, significantly reducing computational costs.
Approach: They propose a low-rank adaptation method that freezes original weights and trains only the update parametrized as a product of two low-ranked matrices.
Outcome: The proposed method accelerates convergence and enhances the global model’s predictive performance.
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.
PRILoRA: Pruned and Rank-Increasing Low-Rank Adaptation (2024.findings-eacl)

Copied to clipboard

Challenge: Several approaches to parameter-efficient fine-tuning have been proposed . low-rank Adaptation (LoRA) does not consider the varying importance of each layer .
Approach: They propose a method that allocates a different rank for each layer and performs pruning throughout the training process.
Outcome: The proposed method is based on eight GLUE benchmarks and is currently the state of the art.
GuiLoMo: Allocating Experts and Ranks for LoRA-MoE via Bilevel Optimization with GuidedSelection Vectors (2025.findings-emnlp)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) methods are efficient for a large language model with reduced computational costs.
Approach: They propose a layer-wise expert numbers and ranks allocation strategy with GuidedSelection Vectors.
Outcome: The proposed method achieves superior or comparable performance to all baselines on three backbone models.

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