Prefix Tuning Using Residual Reparameterization

Fine-tuning large language models for specific tasks requires updating and storing all parameters, leading to significant computational and storage cost issues. To address these challenges, parameter-efficient learning such as prefix tuning has gained attention. However, prefix tuning can suffer from sensitivity to prefix length. This is considered to be due to different prefix tokens being required for each task. In this paper, we propose improving the robustness and performance of prefix tuning through residual reparameterization. We add residual connections to the prefix module, providing more flexibility to the model. Additionally, we propose a gate mechanism to assign weights to prefix tokens, allowing for focus on more important tokens. Our experiments on the GLUE benchmark and E2E dataset demonstrate that our methods lead to improved and stabilized performance across various prefix lengths. The residual connections enable faster convergence during training, while the gate mechanism helps balance prefix tokens and find more optimized parameters. Our approach shows particular effectiveness when combining residual connections with the gate mechanism, outperforming original prefix tuning, especially with longer prefix lengths, while remaining parameter-efficient. We also provide an analysis of gate weight trends during training, offering insights into how the model uses prefix tokens for different prefix lengths.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3554513
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prefix Tuning Using Residual Reparameterization

Hyunsun Hwang, Changki Lee, Youngjun Jung
IEEE Access
Natural Language Processing Techniques
article

Prefix Tuning Using Residual Reparameterization

Hyunsun Hwang, Changki Lee, Youngjun Jung
article en

Abstract

Fine-tuning large language models for specific tasks requires updating and storing all parameters, leading to significant computational and storage cost issues. To address these challenges, parameter-efficient learning such as prefix tuning has gained attention. However, prefix tuning can suffer from sensitivity to prefix length. This is considered to be due to different prefix tokens being required for each task. In this paper, we propose improving the robustness and performance of prefix tuning through residual reparameterization. We add residual connections to the prefix module, providing more flexibility to the model. Additionally, we propose a gate mechanism to assign weights to prefix tokens, allowing for focus on more important tokens. Our experiments on the GLUE benchmark and E2E dataset demonstrate that our methods lead to improved and stabilized performance across various prefix lengths. The residual connections enable faster convergence during training, while the gate mechanism helps balance prefix tokens and find more optimized parameters. Our approach shows particular effectiveness when combining residual connections with the gate mechanism, outperforming original prefix tuning, especially with longer prefix lengths, while remaining parameter-efficient. We also provide an analysis of gate weight trends during training, offering insights into how the model uses prefix tokens for different prefix lengths.

IEEE AccessVol. 13
Kangwon National University (KR)
Ministry of Science and ICT, South Korea
Openalex Percentile: Top 97%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.