Challenge: Existing parameter-efficient fine-tuning methods such as Low-Rank Adaptation ignore the differential parameter budget requirements across weight matrices, which may lead to suboptimal fine-uning outcomes.
Approach: They propose a parameter-efficient low-rank Adaptation method that decomposes high-rank LoRA layers into structured single-rank components and allows dynamic pruning of parameter budget .
Outcome: The proposed method outperforms LoRA and LoRA with the same parameter budget and performance.

Similar Papers

DyLoRA: Parameter-Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptation (2023.eacl-main)

Copied to clipboard

Challenge: Pre-training/fine-tuning of pre-training models has become more expensive and resource-hungry.
Approach: They propose a low-rank adaptation technique that trains LoRA blocks for a range of ranks instead of a single rank.
Outcome: The proposed method trains LoRA blocks for a range of ranks instead of a single rank . it can train dynamic search-free models with DyLoRA at least 4 to 7 times faster than LoRA .
From Bottom to Top: Extending the Potential of Parameter Efficient Fine-Tuning (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to fine-tune large language models primarily focus on the interaction between different layers, ignoring the fact that different layers store different information.
Approach: They propose a Parameter Efficient Fine-Tuning method which freeze pre-trained parameters and fine-tunes only a few task-specific parameters.
Outcome: The proposed methods reduce parameter count to nearly half by omitting fine-tuning in the middle layers.
AFLoRA: Adaptive Freezing of Low Rank Adaptation in Parameter Efficient Fine-Tuning of Large Models (2024.acl-short)

Copied to clipboard

Challenge: Pre-trained language models have demonstrated commendable performance on various NLP tasks.
Approach: They propose a Parameter-Efficient Fine-Tuning (PEFT) method that incrementally freezes low-rank matrices during fine-tuning to reduce computation and alleviate over-fitting.
Outcome: The proposed method achieves state-of-the-art performance with an average improvement of 0.85% on the GLUE benchmark while yielding up to 1.86 improvement as opposed to similar PEFT alternatives.
Sparsity May Be All You Need: Sparse Random Parameter Adaptation (2025.findings-emnlp)

Copied to clipboard

Challenge: Parameter-Efficient Fine-Tuning (PEFT) methods aim at reducing computational and memory resources for fine-tuning large language models.
Approach: They propose to train on a small number of parameters instead of all model parameters . they compare the method to LoRA and find it to be efficient .
Outcome: The proposed method is competitive with LoRA when using a similar number of trainable parameters.
MELoRA: Mini-Ensemble Low-Rank Adapters for Parameter-Efficient Fine-Tuning (2024.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are the default paradigm for natural language processing (NLP) as the models’ scale and the diversity of tasks increase, fine-tuning becomes infeasible.
Approach: They propose to freeze original pretrained weights and train a group of mini LoRAs with only a small number of parameters and reduce their rank by 8 times .
Outcome: The proposed model uses fewer trainable parameters while maintaining a higher rank, thereby offering improved performance potential.
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.
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.
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.
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 .
LoRAN: Improved Low-Rank Adaptation by a Non-Linear Transformation (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent methods for fine-tuning large language models have shown great improvements on a wide range of NLP tasks.
Approach: They propose to introduce a non-linear transformation to improve performance of adapters by introducing a low-rank adaptation to fit the accumulated weight updates.
Outcome: The proposed method outperforms a baseline on SAMSum and 20 Newsgroups tasks and even improves the classification task by 1.95 points when a lower rank is applied.

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