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.

Similar Papers

Layer-wise Importance Matters: Less Memory for Better Performance in Parameter-efficient Fine-tuning of Large Language Models (2024.findings-emnlp)

Copied to clipboard

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.
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.
SparseGrad: A Selective Method for Efficient Fine-tuning of MLP Layers (2024.emnlp-main)

Copied to clipboard

Challenge: High-performance methods for parameter-efficient fine-tuning (PEFT) typically work with Attention blocks and overlook dense MLP blocks, which contain about half of the model parameters.
Approach: They propose a selective PEFT method that performs well on MLP blocks by converting layer gradients into a sparse structure and reducing the number of updated parameters.
Outcome: The proposed method outperforms LoRA and MeProp, robust state-of-the-art PEFT approaches.
BIPEFT: Budget-Guided Iterative Search for Parameter Efficient Fine-Tuning of Large Pretrained Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for parameter-efficient fine-tuning are limited by computational and storage requirements.
Approach: They propose a budget-guided iterative search strategy to disentangle binary module and rank dimension search spaces and early selection strategies based on parameter budgets.
Outcome: The proposed method significantly improves search efficiency on public benchmarks.
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.
Fine-tuning Large Language Models with Limited Data: A Survey and Practical Guide (2026.tacl-1)

Copied to clipboard

Challenge: Pre-trained language models provide strong foundations, but effective adaptation under data scarcity requires efficient and efficient fine-tuning techniques.
Approach: They propose to review parameter-efficient fine-tuning techniques that lower training and deployment costs and domain and cross-lingual adaptation methods for both encoder and decoder models.
Outcome: The proposed techniques lower training and deployment costs, domain and cross-lingual adaptation methods, and model specialization strategies.
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.
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 .
Language Models Can be Efficiently Steered via Minimal Embedding Layer Transformations (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning Large Language Models (LLMs) neglect the embedding layer.
Approach: They propose a PEFT approach that modifies input embeddings without altering hidden layers.
Outcome: Experiments show that TinyTE modifies embeddings without altering hidden layers . the proposed approach achieves competitive performance while requiring 0.0001% of parameters .
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.

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