mlsanityData to 14 Oct 2026

Improving the Sample Efficiency of Prompt Tuning with Domain Adaptation

arXiv 2210.02952 ↗First posted 6 Oct 2022cs.CLcited by 15

Not on the map. Why?

Abstract (arXiv)

Prompt tuning, or the conditioning of a frozen pretrained language model (PLM) with soft prompts learned from data, has demonstrated impressive performance on a wide range of NLP tasks. However, prompt tuning requires a large training dataset to be effective and is outperformed by finetuning the entire PLM in data-scarce regimes. Previous work (Gu et al., 2022, Vu et al., 2022) proposed to transfer soft prompts pretrained on the source domain to the target domain. In this paper, we explore domain adaptation for prompt tuning, a problem setting where unlabeled data from the target domain are available during pretraining. We propose bOosting Prompt TunIng with doMain Adaptation (OPTIMA), which regularizes the decision boundary to be smooth around regions where source and target data distributions are similar. Extensive experiments demonstrate that OPTIMA significantly enhances the transferability and sample-efficiency of prompt tuning compared to strong baselines. Moreover, in few-shot settings, OPTIMA exceeds full-model tuning by a large margin.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 52 of its 66 references that are in the map. First posted on arXiv 6 Oct 2022.

Builds on

52 of 66 references.

References · 52

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  5. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  7. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  8. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  9. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  10. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  11. 2015A large annotated corpus for learning natural language inferencecited by 1,847
  12. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,256
38 more
  1. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  2. 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,060
  3. 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,057
  4. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 938
  5. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  6. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
  7. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  8. 2019EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Taskscited by 807
  9. 2020It's Not Just Size That Matters: Small Language Models Are Also Few-Shot Learnerscited by 669
  10. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 460
  11. 2016Regularization With Stochastic Transformations and Perturbations for Deep Semi-Supervised Learningcited by 441
  12. 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
  13. 2019FreeLB: Enhanced Adversarial Training for Natural Language Understandingcited by 264
  14. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  15. 2021PPT: Pre-trained Prompt Tuning for Few-shot Learningcited by 232
  16. 2022LST: Ladder Side-Tuning for Parameter and Memory Efficient Transfer Learningcited by 230
  17. 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 224
  18. 2021WARP: Word-level Adversarial ReProgrammingcited by 221
  19. 2022Delta Tuning: A Comprehensive Study of Parameter Efficient Methods for Pre-trained Language Modelscited by 180
  20. 2020Neural Unsupervised Domain Adaptation in NLP---A Surveycited by 144
  21. 2020SSMBA: Self-Supervised Manifold Based Data Augmentation for Improving Out-of-Domain Robustnesscited by 96
  22. 2021Why Do Pretrained Language Models Help in Downstream Tasks? An Analysis of Head and Prompt Tuningcited by 82
  23. 2021CONTaiNER: Few-Shot Named Entity Recognition via Contrastive Learningcited by 64
  24. 2019Understanding Generalization through Visualizationscited by 54
  25. 2019Few-Shot NLG with Pre-Trained Language Modelcited by 52
  26. 2022Continual Prompt Tuning for Dialog State Trackingcited by 44
  27. 2022PERFECT: Prompt-free and Efficient Few-shot Learning with Language Modelscited by 40
  28. 2021SSMix: Saliency-Based Span Mixup for Text Classificationcited by 39
  29. 2018Adversarial Domain Adaptation for Duplicate Question Detectioncited by 30
  30. 2021Learn to Resolve Conversational Dependency: A Consistency Training Framework for Conversational Question Answeringcited by 27
  31. 2021Effectiveness of Pre-training for Few-shot Intent Classificationcited by 27
  32. 2019Adversarial Domain Adaptation for Machine Reading Comprehensioncited by 21
  33. 2020KinGDOM: Knowledge-Guided DOMain adaptation for sentiment analysiscited by 16
  34. 2020Towards Open Domain Event Trigger Identification using Adversarial Domain Adaptationcited by 13
  35. 2020Adversarial Training Based Multi-Source Unsupervised Domain Adaptation for Sentiment Analysiscited by 10
  36. 2021Consistency Training with Virtual Adversarial Discrete Perturbationcited by 9
  37. 2021Latent-Optimized Adversarial Neural Transfer for Sarcasm Detectioncited by 6
  38. 2018Input and Weight Space Smoothing for Semi-supervised Learningcited by 4

50 most cited of 52 All 52 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 6; 2024: 5; 2025: 2; 2026: 1.

15 papers.

Sort:

By area: