Challenge: Parameter-Efficient Fine-Tuning (PEFT) methods have gained popularity for adapting pre-trained Large Language Models (LLMs) to downstream tasks.
Approach: They propose a method to optimize the importance of full layers with layer-wise importance scoring by leveraging the estimated importance scores.
Outcome: The proposed method is compatible with PEFT methods that operate on a per-layer basis and achieves better performance.

Similar Papers

GRASS: Gradient-based Adaptive Layer-wise Importance Sampling for Memory-efficient Large Language Model Fine-tuning (2026.findings-acl)

Copied to clipboard

Challenge: Low-rank adaptation methods for large language models limit expressiveness and performance . layer-wise fine-tuning methods overlook variations in layer importance across tasks and training stages, resulting in suboptimal performance on downstream tasks.
Approach: They propose a gradient-based adaptive layer-wise importance sampling framework that updates only a subset of parameters to reduce memory usage.
Outcome: The proposed framework outperforms state-of-the-art methods in accuracy and memory usage.
GAST: Gradient-aligned Sparse Tuning of Large Language Models with Data-layer Selection (2026.eacl-long)

Copied to clipboard

Challenge: Existing methods focus on layer-selective and data-selectory fine-tuning, but ignore the fact that different data points contribute varying degrees to distinct model layers.
Approach: They propose a method that performs selective fine-tuning at both data and layer dimensions as integral components of a unified optimization strategy.
Outcome: Experiments show that the proposed method outperforms baseline methods in terms of performance and performance.
MEFT: Memory-Efficient Fine-Tuning through Sparse Adapter (2024.acl-long)

Copied to clipboard

Challenge: Parameter-Efficient Fine-tuning (PEFT) methods are limited on knowledge-intensive tasks due to the limited number of trainable parameters.
Approach: They propose a mechanism that fine-tunes Large Language Models with larger adapters . they store and update the parameters of larger adapter adapters on the CPU .
Outcome: The proposed method achieves comparable results to those obtained with larger memory capacities over the limited bandwidth of PCI Express (PCIe).
Let the Expert Stick to His Last: Expert-Specialized Fine-Tuning for Sparse Architectural Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies on parameter-efficient fine-tuning (PEFT) for dense-architecture LLMs are lacking.
Approach: They propose an expert-specialized fine-tuning method that tunes the experts most relevant to downstream tasks while freezing the other experts.
Outcome: The proposed method matches or surpasses full-parameter fine-tuning.
PEFT-Bench: A Parameter-Efficient Fine-Tuning Methods Benchmark (2026.eacl-long)

Copied to clipboard

Challenge: Parameter-Efficient Fine-Tuning (PEFT) methods reduce the number of trainable parameters while maintaining strong downstream performance.
Approach: They propose a unified benchmark for evaluating diverse PEFT methods on autoregressive LLMs.
Outcome: The proposed methods reduce trainable parameters while maintaining strong downstream performance.
Efficient Layer-wise LLM Fine-tuning for Revision Intention Prediction (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models have shown extraordinary success across text generation tasks . however, their potential for simple yet essential text classification remains underexplored .
Approach: a plug-and-play layer-wise parameter-efficient fine-tuning framework is proposed . it fine- tunes a subset of important LLM layers while freezing redundant ones .
Outcome: a plug-and-play framework fine-tunes a subset of important LLM layers while freezing redundant layers.
PEFT-Factory: Unified Parameter-Efficient Fine-Tuning of Autoregressive Large Language Models (2026.eacl-demo)

Copied to clipboard

Challenge: Parameter-Efficient Fine-Tuning (PEFT) methods address the increasing size of Large Language Models (LLMs).
Approach: They propose a framework for efficient fine-tuning Large Language Models (LLMs) they aim to train only a small percentage of the full model's parameters .
Outcome: Xu et al., 2023; Ding e t al, 2024; Lialin e al. 2023) show that using PEFT methods can improve performance.
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.
Unlocking Parameter-Efficient Fine-Tuning for Low-Resource Language Translation (2024.findings-naacl)

Copied to clipboard

Challenge: Parameter-efficient fine-tuning (PEFT) methods are important in low-resource language (LRL) Neural Machine Translation (NMT) but their practical effectiveness varies significantly across different languages.
Approach: They evaluated the performance of 8 parameters-efficient fine-tuning methods with 15 architectures using the SacreBLEU score.
Outcome: The Houlsby+Inversion adapter outperforms the baseline architectures in both in-domain and out-domain tests and the Houlson+Inverter achieves the best performance overall.
Evolving Sparsity: Leveraging Token Importance Dynamics for Efficient LLM Decoding with Sparse Attention (2026.acl-long)

Copied to clipboard

Challenge: Efficient long-context inference remains a major challenge for large language models (LLMs), as the cost of attention computation during auto-regressive decoding grows linearly with the context length.
Approach: They propose to model token importance as a dynamic process that evolves over decoding steps and propagates through model layers.
Outcome: The proposed method outperforms baseline sparse attention methods and achieves speedups of up to 5.36 for attention latency and 2.33 for end-to-end decoding.

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