mlsanityData to 7 Oct 2026

Efficiently Enhancing Zero-Shot Performance of Instruction Following Model via Retrieval of Soft Prompt

arXiv 2210.03029 ↗First posted 6 Oct 2022cs.CL cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Enhancing the zero-shot performance of instruction-following models requires heavy computation, either by scaling the total number of training datasets or the model size. In this work, we explore how retrieval of soft prompts obtained through prompt tuning can efficiently assist hard prompts in zero-shot task generalization. Specifically, we train soft prompt embeddings for each prompt through prompt tuning, store the samples of the training instances mapped with the prompt embeddings, and retrieve the corresponding prompt embedding of the training instance closest to the query instance during inference. While only adding 0.007% additional parameters, retrieval of soft prompt enhances the performance of T0 on unseen tasks by outperforming it on 10 out of 11 datasets as well as improving the mean accuracy of T0 on BIG-bench benchmark by 2.39% points. Also, we report an interesting finding that retrieving source embeddings trained on similar answer choice formats is more important than those on similar task types.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 56 of its 85 references that are in the map. First posted on arXiv 6 Oct 2022.

Builds on

56 of 85 references.

References · 56

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2022Training language models to follow instructions with human feedbackcited by 15,712
  3. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  4. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  6. 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
  7. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  9. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  10. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
  11. 2017Billion-scale similarity search with GPUscited by 2,477
  12. 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
38 more
  1. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,970
  2. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
  3. 2022Rethinking the Role of Demonstrations: What Makes In-Context Learning Work?cited by 1,413
  4. 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,371
  5. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,308
  6. 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
  7. 2021What Makes Good In-Context Examples for GPT-3?cited by 1,184
  8. 2021Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivitycited by 1,122
  9. 2021Learning to Prompt for Continual Learningcited by 938
  10. 2021An Explanation of In-context Learning as Implicit Bayesian Inferencecited by 915
  11. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
  12. 2019Adversarial NLI: A New Benchmark for Natural Language Understandingcited by 798
  13. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  14. 2021Cross-Task Generalization via Natural Language Crowdsourcing Instructionscited by 696
  15. 2021Learning To Retrieve Prompts for In-Context Learningcited by 641
  16. 2021Prompt Programming for Large Language Models: Beyond the Few-Shot Paradigmcited by 599
  17. 2020KILT: a Benchmark for Knowledge Intensive Language Taskscited by 571
  18. 2019SAMSum Corpus: A Human-annotated Dialogue Dataset for Abstractive Summarizationcited by 530
  19. 2021Datasets: A Community Library for Natural Language Processingcited by 526
  20. 2021MetaICL: Learning to Learn In Contextcited by 450
  21. 2016A Corpus and Evaluation Framework for Deeper Understanding of Commonsense Storiescited by 413
  22. 2019PAWS: Paraphrase Adversaries from Word Scramblingcited by 395
  23. 2021Learning How to Ask: Querying LMs with Mixtures of Soft Promptscited by 376
  24. 2018WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representationscited by 370
  25. 2019Explain Yourself! Leveraging Language Models for Commonsense Reasoningcited by 367
  26. 2021Do Prompt-Based Models Really Understand the Meaning of their Prompts?cited by 324
  27. 2022PromptSource: An Integrated Development Environment and Repository for Natural Language Promptscited by 288
  28. 2019Cosmos QA: Machine Reading Comprehension with Contextual Commonsense Reasoningcited by 281
  29. 2022Can language models learn from explanations in context?cited by 248
  30. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  31. 2021PPT: Pre-trained Prompt Tuning for Few-shot Learningcited by 232
  32. 2017Constructing Datasets for Multi-hop Reading Comprehension Across Documentscited by 190
  33. 2022What Language Model Architecture and Pretraining Objective Work Best for Zero-Shot Generalization?cited by 149
  34. 2020Beat the AI: Investigating Adversarial Human Annotation for Reading Comprehensioncited by 131
  35. 2021Adapting Language Models for Zero-shot Learning by Meta-tuning on Dataset and Prompt Collectionscited by 128
  36. 2020Intermediate-Task Transfer Learning with Pretrained Models for Natural Language Understanding: When and Why Does It Work?cited by 127
  37. 2019Reasoning Over Paragraph Effects in Situationscited by 79
  38. 2021On Transferability of Prompt Tuning for Natural Language Processingcited by 74

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year

Citing papers per year: 2023: 2.

2 papers.