mlsanityData to 14 Oct 2026

Prompt Tuning Strikes Back: Customizing Foundation Models with Low-Rank Prompt Adaptation

arXiv 2405.15282 ↗First posted 24 May 2024cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

Parameter-Efficient Fine-Tuning (PEFT) has become the standard for customising Foundation Models (FMs) to user-specific downstream tasks. However, typical PEFT methods require storing multiple task-specific adapters, creating scalability issues as these adapters must be housed and run at the FM server. Traditional prompt tuning offers a potential solution by customising them through task-specific input prefixes, but it under-performs compared to other PEFT methods like LoRA. To address this gap, we propose Low-Rank Prompt Adaptation (LoPA), a prompt-tuning-based approach that performs on par with state-of-the-art PEFT methods and full fine-tuning while being more parameter-efficient and not requiring a server-based adapter. LoPA generates soft prompts by balancing between sharing task-specific information across instances and customization for each instance. It uses a low-rank decomposition of the soft-prompt component encoded for each instance to achieve parameter efficiency. We provide a comprehensive evaluation on multiple natural language understanding and code generation and understanding tasks across a wide range of foundation models with varying sizes.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 32 of its 39 references that are in the map. First posted on arXiv 24 May 2024.

Builds on

32 of 39 references.

References · 32

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  7. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  9. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  10. 2021Program Synthesis with Large Language Modelscited by 3,637
  11. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  12. 2020CodeBERT: A Pre-Trained Model for Programming and Natural Languagescited by 1,310
20 more
  1. 2024DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligencecited by 1,181
  2. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
  3. 2022CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesiscited by 885
  4. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  5. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  6. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  7. 2021GPT Understands, Toocited by 716
  8. 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 689
  9. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
  10. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 460
  11. 2021Learning How to Ask: Querying LMs with Mixtures of Soft Promptscited by 377
  12. 2024CRUXEval: A Benchmark for Code Reasoning, Understanding and Executioncited by 300
  13. 2021WARP: Word-level Adversarial ReProgrammingcited by 221
  14. 2021Beyond Fully-Connected Layers with Quaternions: Parameterization of Hypercomplex Multiplications with 1/n Parameterscited by 66
  15. 2022IDPG: An Instance-Dependent Prompt Generation Methodcited by 43
  16. 2023When Do Prompting and Prefix-Tuning Work? A Theory of Capabilities and Limitationscited by 43
  17. 2023DePT: Decomposed Prompt Tuning for Parameter-Efficient Fine-tuningcited by 35
  18. 2023Batched Low-Rank Adaptation of Foundation Modelscited by 32
  19. 2024Code Representation Learning At Scalecited by 26
  20. 2022Late Prompt Tuning: A Late Prompt Could Be Better Than Many Promptscited by 23

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 1.

8 papers.