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.

Similar Papers

Intention-Adaptive LLM Fine-Tuning for Text Revision Generation (2026.findings-eacl)

Copied to clipboard

Challenge: Existing work on large language models (LLMs) has demonstrated impressive capabilities in context-based text generation tasks, such as summarization and reasoning.
Approach: They propose an intention-adaptive layer-wise LLM fine-tuning framework that dynamically selects a subset of LLM layers to learn intentions and transfers them to revision generation.
Outcome: The proposed framework outperforms PEFT baselines on small revision corpora while maintaining fast convergence and accuracy.
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.
Let’s Focus on Neuron: Neuron-Level Supervised Fine-tuning for Large Language Model (2025.coling-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) are composed of neurons that exhibit diverse behaviors and roles.
Approach: They propose a novel approach that refines the granularity of parameter training down to the individual neuron, enabling a more parameter-efficient fine-tuning model.
Outcome: The proposed approach exceeds the performance of full-parameter fine-tuning and PEFT and provides insights into the analysis of neurons.
UORA: Uniform Orthogonal Reinitialization Adaptation in Parameter Efficient Fine-Tuning of Large Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods such as LoRA and VeRA use a low-rank approximation method that reduces the number of trainable parameters without compromising performance.
Approach: They propose a parameter-efficient fine-tuning approach that leverages a low-rank approximation method that reduces the number of trainable parameters without compromising performance.
Outcome: The proposed approach outperforms existing methods on GLUE and E2E benchmarks and is effective in instruction-tuning large language models and image classification models.
Propulsion: Steering LLM with Tiny Fine-Tuning (2025.coling-main)

Copied to clipboard

Challenge: Propulsion is a parameter-efficient fine-tuning method that selectively re-scales specific dimensions of a pre-trained model without modifying the model’s parameters.
Approach: They propose a parameter-efficient fine-tuning method that selectively re-scales specific dimensions of a pre-trained model without modifying the parameters.
Outcome: The proposed method reduces parameter count from 355.3 million to 0.086 million while maintaining competitive performance across benchmarks.
Improving the OOD Performance of Closed-Source LLMs on NLI Through Strategic Data Selection (2026.findings-eacl)

Copied to clipboard

Challenge: Existing methods to improve robustness require changing the fine-tuning process or large-scale data augmentation, which are infeasible or cost prohibitive for closed-source models.
Approach: They propose to prioritize more complex examples or replace existing training examples with LLM-generated data to improve performance on OOD NLI datasets.
Outcome: The proposed methods improve performance on difficult OOD datasets while training with synthetic data leads to substantial improvements on easier OOD data.
A Study of Parameter Efficient Fine-tuning by Learning to Efficiently Fine-Tune (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for parameter-efficient fine-tuning (PEFT) are limited due to the need for increased computational resources.
Approach: They propose a method to learn PEFT parameters from data by projecting high dimensional parameters onto low dimensional parameter manifolds or identifying PEFT parametrically.
Outcome: The proposed method can be used to identify PEFT parameters on GLUE tasks.
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.
LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown unprecedented performance across various tasks.
Approach: They propose an easy-to-use framework that integrates adapters into LLMs . they evaluate adapters on 14 datasets from two different reasoning tasks .
Outcome: The proposed framework can be used to fine-tune open-access language models with task-specific data and instruction data.
A Semantic-Aware Layer-Freezing Approach to Computation-Efficient Fine-Tuning of Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing work on how to finetune but neglects the issue of where to fine-tune language models is expensive.
Approach: They propose to use transition traces of latent representation to compute deviations (or loss) and then estimate the gain of each layer in reducing deviation (or gain).
Outcome: The proposed approach outperforms baseline methods and is cost-benefit balanced.

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