PrefixMemory-Tuning: Modernizing Prefix-Tuning by Decoupling the Prefix from Attention
Not on the map. Why?
Abstract (arXiv)
Parameter-Efficient Fine-Tuning (PEFT) methods have become crucial for rapidly adapting large language models (LLMs) to downstream tasks. Prefix-Tuning, an early and effective PEFT technique, demonstrated the ability to achieve performance comparable to full fine-tuning with significantly reduced computational and memory overhead. However, despite its earlier success, its effectiveness in training modern state-of-the-art LLMs has been very limited. In this work, we demonstrate empirically that prefix-tuning underperforms on LLMs because of an inherent tradeoff between the contribution of the input prompt and the parameterized prefix within the attention head. This motivates us to introduce PrefixMemory-Tuning, an architecture that generalizes the principles of prefix-tuning while addressing its shortcomings by shifting the prefix module out of the attention head itself and improving its expressiveness. Our experiments show that, across diverse benchmarks, PrefixMemory-Tuning consistently outperforms existing prefix-tuning methods. Notably, it achieves competitive performance with modern PEFTs on several general benchmarks, highlighting a potential extension of prefix-tuning approaches to become state-of-the-art. Our findings suggest that by overcoming its inherent limitations, prefix-tuning can remain a competitive and relevant research direction in the landscape of parameter-efficient LLM adaptation.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 41 of its 53 references that are in the map. First posted on arXiv 16 Jun 2025.
Builds on
41 of 53 references.
References · 41
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
29 more
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,998
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2024LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Modelscited by 1,464
- 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,433
- 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,392
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2024OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problemscited by 1,136
- 2024SimPO: Simple Preference Optimization with a Reference-Free Rewardcited by 963
- 2021GPT Understands, Toocited by 716
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 689
- 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 532
- 2020GoEmotions: A Dataset of Fine-Grained Emotionscited by 486
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2020Efficient Intent Detection with Dual Sentence Encoderscited by 433
- 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
- 2024Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attentioncited by 200
- 2023E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuningcited by 70
- 2025Critique Fine-Tuning: Learning to Critique is More Effective than Learning to Imitatecited by 63
- 2024Linearizing Large Language Modelscited by 51
- 2023When Do Prompting and Prefix-Tuning Work? A Theory of Capabilities and Limitationscited by 43
- 2024REEF: Representation Encoding Fingerprints for Large Language Modelscited by 36
- 2023DePT: Decomposed Prompt Tuning for Parameter-Efficient Fine-tuningcited by 35
- 2024Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Promptscited by 15
- 2024Empirical Study on Updating Key-Value Memories in Transformer Feed-forward Layerscited by 8
- 2024Exact Conversion of In-Context Learning to Model Weights in Linearized-Attention Transformerscited by 7
- 2025ADePT: Adaptive Decomposed Prompt Tuning for Parameter-Efficient Fine-tuningcited by 3
- 2025MINT: Memory-Infused Prompt Tuning at Test-time for CLIPcited by 3
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026A Visual Semantic Adaptive Watermark grounded by Prefix-Tuning for Large Vision-Language Modelcited by 3
- 2026ReasonCACHE: Teaching LLMs To Reason Without Weight Updatescited by 3
- 2026PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Promptscited by 0
- 2026When Can Prefixes Compile LoRA? Exact Resource-Capped Tests for Frozen Attentioncited by 0
- 2026When Can Prefixes Compile LoRA? Exact Resource-Capped Tests for Frozen Attention29 Sep 2026
- 2026PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts13 May 2026
- 2026ReasonCACHE: Teaching LLMs To Reason Without Weight Updates2 Feb 2026
- 2026A Visual Semantic Adaptive Watermark grounded by Prefix-Tuning for Large Vision-Language Model12 Jan 2026