mlsanityData to 14 Oct 2026

Can discrete information extraction prompts generalize across language models?

arXiv 2302.09865 ↗First posted 20 Feb 2023cs.CL cs.AI cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

We study whether automatically-induced prompts that effectively extract information from a language model can also be used, out-of-the-box, to probe other language models for the same information. After confirming that discrete prompts induced with the AutoPrompt algorithm outperform manual and semi-manual prompts on the slot-filling task, we demonstrate a drop in performance for AutoPrompt prompts learned on a model and tested on another. We introduce a way to induce prompts by mixing language models at training time that results in prompts that generalize well across models. We conduct an extensive analysis of the induced prompts, finding that the more general prompts include a larger proportion of existing English words and have a less order-dependent and more uniform distribution of information across their component tokens. Our work provides preliminary evidence that it's possible to generate discrete prompts that can be induced once and used with a number of different models, and gives insights on the properties characterizing such prompts.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 20 Feb 2023.

Builds on

22 of 30 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  4. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
  5. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  6. 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
  7. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  8. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  9. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,234
  10. 2019Language Models as Knowledge Bases?cited by 1,936
  11. 2016Enriching Word Vectors with Subword Informationcited by 1,583
  12. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,470
10 more
  1. 2019How Can We Know What Language Models Know?cited by 959
  2. 2019Universal Adversarial Triggers for Attacking and Analyzing NLPcited by 722
  3. 2020It's Not Just Size That Matters: Small Language Models Are Also Few-Shot Learnerscited by 669
  4. 2021Factual Probing Is [MASK]: Learning vs. Learning to Recallcited by 291
  5. 2021Masked Language Modeling and the Distributional Hypothesis: Order Word Matters Pre-training for Littlecited by 177
  6. 2022A Review on Language Models as Knowledge Basescited by 157
  7. 2021The MultiBERTs: BERT Reproductions for Robustness Analysiscited by 92
  8. 2021BERTese: Learning to Speak to BERTcited by 82
  9. 2021On Transferability of Prompt Tuning for Natural Language Processingcited by 75
  10. 2021Prompt Waywardness: The Curious Case of Discretized Interpretation of Continuous Promptscited by 64

Built on by

Cited by year

Citing papers per year: 2023: 4; 2024: 2; 2025: 2.

8 papers.