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.

Similar Papers

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.
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.
HyperAdaLoRA: Accelerating LoRA Rank Allocation During Training via Hypernetworks without Sacrificing Performance (2026.findings-acl)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) assumes a uniform rank r for each incremental matrix, not accounting for the varying significance of weight matrices across modules and layers.
Approach: They propose a framework that allows for faster convergence of low-rank adaptive models . they use a hypernetwork to prune the outputs of the hypernetworks to generate parameters .
Outcome: The proposed framework accelerates convergence of AdaLoRA by leveraging a hypernetwork.
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.
LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning (2024.findings-acl)

Copied to clipboard

Challenge: Low-rank adaption (LoRA) is a low-level pruning method that can be expensive and slow to deploy.
Approach: They propose a low-rank adaption pruning framework that provides an accurate structured pruned model in a memory-efficient manner.
Outcome: The proposed pruning framework reduces perplexity and memory usage by 52.6% on LLaMA and T5 models while reducing memory usage.
AutoLoRA: Automatically Tuning Matrix Ranks in Low-Rank Adaptation Based on Meta Learning (2024.naacl-long)

Copied to clipboard

Challenge: Large-scale pretraining followed by task-specific finetuning has achieved great success in various NLP tasks.
Approach: They propose a meta learning based framework for automatically identifying the optimal rank of each LoRA layer.
Outcome: The proposed framework is based on a meta learning based framework that can identify the optimal rank of each LoRA layer.
ResLoRA: Identity Residual Mapping in Low-Rank Adaption (2024.findings-acl)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is one of the most popular parameter-efficient fine-tuning methods.
Approach: They propose a low-rank adaptation method that adds residual paths during training and merges them together during inference to achieve better results.
Outcome: The proposed method achieves 2.5x faster convergence speed and improves performance by 14.3% on NLG, NLU, and text-to-image tasks.
RankAdaptor: Hierarchical Rank Allocation for Efficient Fine-Tuning Pruned LLMs via Performance Model (2025.findings-naacl)

Copied to clipboard

Challenge: Current compression techniques entail structural pruning and a recovery phase that leverages the Low-Rank Adaptation algorithm.
Approach: They propose a hierarchical rank allocation method that enables efficient fine-tuning of pruned LLMs according to layerwise specific recovery requirements.
Outcome: The proposed algorithm outperforms state-of-the-art methods across pruning settings and LLM architectures with improvements ranging from 0.7% to 5.5%.
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.
AlphaLoRA: Assigning LoRA Experts Based on Layer Training Quality (2024.emnlp-main)

Copied to clipboard

Challenge: Recent studies combine LoRA with Mixture-of-Experts (MoE) to improve performance in Large Language Models.
Approach: They propose a method to combine LoRA and Mixture-of-Experts (MoE) to improve performance in Large Language Models.
Outcome: The proposed method reduces redundancy in LoRA experts within the MoE architecture, and improves training quality across layers.

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