Challenge: Large language models (LLMs) require computational resources for fine-tuning.
Approach: They propose a framework that optimizes rank allocation via two stages . they propose an initial pruning stage and a progressive pruning stage .
Outcome: The proposed framework outperforms existing PEFT baselines on GLUE and instruction-following tasks while reducing training time and trainable parameters by over 80%.

Similar Papers

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.
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.
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 .
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% .
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.
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.
Flexora: Flexible Low-Rank Adaptation for Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have revolutionized artificial intelligence, but performance on specific tasks is limited by knowledge boundaries.
Approach: They propose a method that automatically selects the most critical layers for fine-tuning to optimize performance across diverse downstream tasks.
Outcome: The proposed method outperforms baseline models and natural language tasks.
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.
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.

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