Venue: NAACL 2021

# Learning How to Ask: Querying LMs with Mixtures of Soft Prompts

Guanghui Qin and Jason Eisner

Department of Computer Science, Johns Hopkins University

gqin2@jhu.edu jasoncs.jhu.edu

###### Abstract

Natural-language prompts have recently been used to coax pretrained language models into performing other AI tasks, using a fill-in-the-blank paradigm (Petroni et al., 2019) or a few-shot extrapolation paradigm (Brown et al., 2020). For example, language models retain factual knowledge from their training corpora that can be extracted by asking them to "fill in the blank" in a sentential prompt. However, where does this prompt come from? We explore the idea of learning prompts by gradient descent--either fine-tuning prompts taken from previous work, or starting from random initialization. Our prompts consist of "soft words," i.e., continuous vectors that are not necessarily word type embeddings from the language model. Furthermore, for each task, we optimize a mixture of prompts, learning which prompts are most effective and how to ensemble them. Across multiple English LMs and tasks, our approach hugely outperforms previous methods, showing that the implicit factual knowledge in language models was previously underestimated. Moreover, this knowledge is cheap to elicit: random initialization is nearly as good as informed initialization.

+
Footnote †: _Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies_, pages 5203–5212 June 6–11, 2021. ©2021 Association for Computational Linguistics

## 1 Introduction

Pretrained language models, such as ELMo (Peeters et al., 2018), BERT (Devlin et al., 2019), and BART (Lewis et al., 2020a), have proved to provide useful representations for other NLP tasks. Recently, Petroni et al. (2019) and Jiang et al. (2020) demonstrated that language models (LMs) also contain factual and commonsense knowledge that can be elicited with a prompt. For example, to query the date-of-birth of Mozart, we can use the prompt "Mozart was born in ____," where we have filled the first blank with "Mozart," and ask a cloze language model to fill in the second blank. The prompts used by Petroni et al. (2019) are manually created, while Jiang et al. (2020) use mining and paraphrasing based methods to automatically augment the prompt sets.

Finding out what young children know is difficult because they can be very sensitive to the form of the question (Donaldson, 1978). Opinion polling is also sensitive to question design (Broughton, 1995). We observe that when we are querying an LM rather than a human, we have the opportunity to _tune_ prompts using gradient descent--the workhorse of modern NLP--so that they better elicit the desired type of knowledge.

A neural LM sees the prompt as a sequence of continuous word vectors (Baroni et al., 2014). We tune in this continuous space, relaxing the constraint that the vectors be the embeddings of actual English words. Allowing "soft prompts" consisting of "soft words" is not only convenient for optimization, but is also more expressive. Soft prompts can emphasize particular words (by lengthening their vectors) or particular dimensions of those words. They can also adjust words that are misleading, ambiguous, or overly specific. Consider the following prompt for the relation date-of-death:

\[\tikzfig{}\text{ performed until his death in $\!

mon sense relations from 3 datasets. Comparing on held-out examples, our method dramatically outperforms previous work, even when initialized randomly. So when regarded as approximate knowledge bases, language models know more than we realized. We just had to find the right ways to ask.

## 2 Related Work

Factual knowledge is traditionally extracted from large corpora using a pipeline of NLP tools (Surdeanu and Ji, 2014), including entity extraction (Lample et al., 2016), entity linking (Rao et al., 2013) and relation extraction Sorokin and Gurevych (2017).

However, recent work has shown that simply training a system to complete sentences--language modeling--causes it to implicitly acquire nonlinguistic abilities from its training corpora Rogers et al. (2020), including factual knowledge Petroni et al. (2019); Jiang et al. (2020), common sense (Bisk et al., 2019), reasoning Talmor et al. (2020); Brown et al. (2020), summarization Radford et al. (2019), and even arithmetic Bouraoui et al. (2020).

Most of the previous work manually creates prompts to extract answers from the trained language model. We use LAMA Petroni et al. (2019) as a baseline. Building on LAMA, the LM Prompt And Query Archive (LPAQA) method Jiang et al. (2020) searches for new prompts by either mining a corpus or paraphrasing existing prompts. AutoPrompt Shin et al. (2020) searches for improved prompts using a gradient signal, although its prompts are limited to sequences of actual ("hard") English words, unlike our method. We compare our novel soft prompts against all of these systems.

After we submitted the present paper in November 2020, two still unpublished manuscripts appeared on arXiv that also investigated soft prompts. Li and Liang (2021) considered the setting of generating text from a pretrained language model (GPT-2 or BART) conditioned on a textual prompt. To improve the results, they prepended a few task-specific "soft tokens" to the prompt and tuned the embeddings of only these tokens (at all embedding layers). Liu et al. (2021) adopted a strategy similar to ours by tuning fill-in-the-blank prompts in a continuous space, testing on GPT-2 and BERT models, although they did not use the enhancements we proposed in SSSS3.2-3.4 below. Like our work, both these papers achieved strong gains.

In other work, Bouraoui et al. (2020) mine prompts from a corpus, then fine-tune the whole language model so that it more accurately completes the prompts. Schick and Schutze (2020, 20) are similar but fine-tune the language model differently for each prompt. Our method complements these by tuning the prompts themselves.

"Probing" systems that ask what language models know _about particular sentences_ (e.g., Eichler et al., 2019) usually use feedforward networks rather than further natural-language prompts. Yet Shin et al. (2020) show how to use natural-language prompts to ask about particular sentences. Our method could potentially be applied to those prompts, or to "few-shot learning" prompts that include input-output examples (Brown et al., 2020).

## 3 Method

Our experiments will specifically aim at extracting relational knowledge from language models. We are given a fixed pretrained LM, a specific binary relation \(r\) such as date-of-death, and a training dataset \({\cal E}_{r}\) consisting of known \((x,y)\) pairs in \(r\), such as Mary Cassatt (1926). We will then train a system to predict \(y\) from \(x\), and evaluate it on held-out \((x,y)\) pairs of the same relation.

A prompt **t** is a sentence or phrase that includes two blanks, as illustrated in SS1. To pose the query, we fill the \(\underline{\phantom{\rule{5.0pt}{8.452756pt}}}_{\rm x}\) blank with \(x\):

\[\begin{array}{l}\text{Mary\ Cassatt performed until his death}\\ \text{in\ $\underline{\phantom{\rule{5.0pt}{8.452756pt}}}$}y.\end{array}\]

We can ask the LM for its probability distribution \(p_{\mathrm{LM}}(y~{}|~{}\mathbf{t},x)\) over single words that can now fill \(\underline{\phantom{\rule{5.0pt}{8.452756pt}}}_{\rm y}\). The correct answer would be 1926.

### Soft Prompts

Suppose the LM identifies the word types with vectors in \(\mathbb{R}^{d}\). We also allow \(\mathbf{t}\) to be a soft prompt, in which the tokens can be arbitrary vectors in \(\mathbb{R}^{d}\):

\[\begin{array}{ccccccc}\underline{\phantom{\rule{5.0pt}{8.452756pt}}}&v_{1}& v_{2}&v_{3}&v_{4}&v_{5}&\underline{\phantom{\rule{5.0pt}{8.452756pt}}}&v_{6} \\ \end{array}\]

We can initialize these vectors to match those of a given hard prompt. (Each token of a hard prompt may be a word, subword, or punctuation mark, according to the tokenization procedure used by the LM.) However, we can then tune the vectors continuously. We do not change the number of vectors or their positions. For the prompt shown above, we have a \(6d\)-dimensional search space 



### Deeply Perturbed Prompts

For each token \(i\) of a prompt, the vector \(v_{i}\) enters into the LM's computations that complete the prompt. For example, a Transformer architecture computes successively deeper contextual embeddings of the token, \(v^{(\ell)}_{i}:0\leq\ell\leq L\). Here \(v^{(0)}_{i}=v_{i}\) and the embedding \(v^{(\ell)}_{i}\) at layer \(\ell>0\) is computed from all tokens' embeddings \(v^{(\ell-1)}_{j}\) at the previous layer, using the LM's parameters.

We can tune the prompt by additively perturbing each \(v^{(\ell)}_{i}\) by a small vector \(\Delta^{(\ell)}_{i}\) before it is used in further computations. The \(\Delta\) vectors for a given hard prompt are initialized to 0 and then tuned.

Perturbing only layer 0 is equivalent to tuning \(v_{i}\) directly as in SS3.1. However, if we are more aggressive and perturb all layers, we now have \(6d\cdot(L+1)\) parameters to tune a 6-token prompt. The perturbations (\(\Delta\) vectors) can be kept small through early stopping or some other form of regularization. Our intuition is that small perturbations will yield more "familiar" activation patterns that are similar to those that the LM was originally trained on. Li and Liang (2021) tried a rather different approach to preventing overfitting when tuning all layers.)

### Mixture Modeling

Given a set \(\mathcal{T}_{r}\) of soft prompts for relation \(r\), we can define the ensemble predictive distribution

\[p(y\mid x,r)=\sum_{\mathbf{t}\in\mathcal{T}_{r}}p(\mathbf{t}\mid r)\cdot p_{ \mathrm{LM}}(y\mid\mathbf{t},x) \tag{1}\]

where the learned mixture weights \(p(\mathbf{t}\mid r)\) form a distribution over the soft prompts \(\mathbf{t}\in\mathcal{T}_{r}\). Ensembling techniques other than mixture-of-experts could also be used, including product-of-experts Jiang et al. (2020).

### Data-Dependent Mixture Modeling

As an extension, we can replace the mixture weights \(p(\mathbf{t}\mid r)\) with \(p(\mathbf{t}\mid r,x)\), to allow the model to select prompts that are appropriate for the given \(x\). For example, a plural noun \(x\) might prefer prompts \(\mathbf{t}\) that use a plural verb.

While we could directly build a neural softmax model for \(p(\mathbf{t}\mid r,x)\), it seems useful to capture the intuition that \(\mathbf{t}\) may work better if \(x\) is plausible in its \(\underset{x}{\text{\rule{0.4pt}{5.798931pt}}}\). Thus, we instead use Bayes' Theorem to write \(p(\mathbf{t}\mid r,x)\) as proportional to \(p(\mathbf{t}\mid r)\cdot p(x\mid\mathbf{t},r)^{1/T}\), where we have included \(T\) to modulate the strength of the above intuition.1 Here \(p(\mathbf{t}\mid r)\) is still a learned distribution over prompts, and we use the fixed language model to estimate the second factor as \(\sum_{y}p_{\mathrm{LM}}(x,y\mid\mathbf{t})\) (dropping the dependence on \(r\) just as we did for the second factor of (1)). \(\log T\) is tuned along with all other parameters.

Footnote 1: Raising the temperature \(T\) increases the entropy of the mixture to get the benefits of ensembling; without \(T\), the strong language model usually places almost all the weight on a single prompt.

### Training Objective

Given an initial set of prompts \(\mathcal{T}_{r}\), we jointly optimize the soft prompts \(\mathbf{t}\in\mathcal{T}\) and their mixture weights \(p(\mathbf{t}\mid r)\) (and \(\log T\) in SS3.4) to minimize the log-loss of the predictive distribution (1):

\[\sum_{(x,y)\in\mathcal{E}_{r}}-\log\sum_{\mathbf{t}\in\mathcal{T}_{r}}p(y\mid \mathbf{t},x) \tag{2}\]

This is a continuous and differentiable objective whose gradient can be computed by backpropagation. It can be locally minimized by gradient descent (using a softmax parameterization of the mixture weights). Equivalently, it can be locally minimized by the EM algorithm: the E step finds a posterior distribution over latent prompts for each \((x,y)\) example, and the M step performs gradient descent to optimize the prompts in that mixture.

## 4 Experiments

### Relational Datasets

The relations we learn to predict are T-REx original Elshar et al. (2018), T-REx extended Shin et al. (2020), Google-RE Orr (2013), and ConceptNet Speer et al. (2017)--or rather, the subsets that were used by the LAMA and AutoPrompt papers. See Appendix A for some statistics.

### Language Models

Following Petroni et al. (2019), we interrogate BERT Devlin et al. (2019) and RoBERTa Liu et al. (2019). These are masked (cloze) language models. For variety, we also interrogate BART Lewis et al. (2020), which conditions on the prompt with empty \(\underset{y}{\text{\rule{0.4pt}{5.798931pt}}}\) and generates a copy where \(\underset{y}{\text{\rule{0.4pt}{5.798931pt}}}\) has been filled in (by a single token). We constrain BART's decoding to ensure that its answer does take this form. Unlike BERT and RoBERTa, BART could be used to fill \(\underset{y}{\text{\rule{0.4pt}{5.798931pt}}}\) with

an arbitrarily long phrase, but we do not allow this because \(y\) in our datasets is always a single token.2

Footnote 2: Among other filters, the LAMA and AutoPrompt papers keep only the triples \((r,x,y)\) such that \(y\) is a single token according to the language models used by LAMA. When working with BART, we further require \(y\) to be a single token according to BART’s tokenization; thus, the BART results are not comparable with the other language models.

### Dataset Splits

For the two T-REx datasets, we inherit the training-validation-test split from Shin et al. (2020). For the other datasets, we split randomly in the ratio 80-10-10.3 Since all pairs \((x,y)\) are distinct, there are no common triples among these three sets. Common \(x\) values are also rare because each dataset has at least 174 distinct \(x\) values. However, the number of distinct \(y\) values can be as small as 6. Thus, in another set of experiments (Appendix E), we used a more challenging split that ensures that there are no common \(y\) values among these three sets. This tests whether our model generalizes to unseen values.

Footnote 3: The LAMA paper Petroni et al. (2019) provided no split but used everything as test data for their zero-shot method.

### Prompts

For the T-REx and Google-RE datasets, we have four sources of initial prompts:

* (sin.) LAMA provides a **single** manually created hard prompt for each relation type \(r\).
* (par.) LPAQA Jiang et al. (2020) provides a set of 13-30 hard prompts for each \(r\), which are **para**phrases of the LAMA prompt.4 Footnote 4: The LPAQA system combines their predictions via a learned weighted product of experts.
* (min.) LPAQA also provides a set of 6-29 hard prompts for each \(r\), based on text **min**ing.
* (ran.) For each (min.) prompt, we replace each word with a **random** vector, drawn from a Gaussian distribution fit to all of the LM's word embeddings. The number of words and the position of the blanks are preserved.

For the ConceptNet dataset, LAMA uses the gold Open Mind Common Sense (OMCS) dataset Singh et al. (2002). In this dataset, each example \((x_{i},y_{i})\) is equipped with its own prompt \(\mathbf{t}_{i}\). (Each example is really a sentence with two substrings marked as \(x\) and \(y\), which are removed to obtain \(\mathbf{t}_{i}\).) These prompts are often overly specific: often \(y_{i}\) can be predicted from \((\mathbf{t}_{i},x_{i})\), or just from \(\mathbf{t}_{i}\) alone, but \(y_{j}\) cannot be predicted from \((\mathbf{t}_{i},x_{j})\). Thus, for each relation \(r\), we use only the prompts that appear more than 10 times, resulting in 1-38 prompts.

Statistics about the prompts are in Appendix B.

We used only a single copy of each prompt, but a generalization would be to allow multiple slightly perturbed copies of each prompt, which could diverge and specialize during training Rose (1998).

### Training

We optimize equation (2) with the method introduced in SS3.5. We use the Adam optimizer Kingma and Ba (2015) with its default configuration. For gradient training, we set the batch size as 64, early-stop patience as 4, and test with the model that performs best on the dev set among 16 training epochs.

Training is fast. Even for our largest model (BERT-large-cased) and largest dataset (T-REx extended), tuning a single prompt completes within a few minutes. With a mixture of prompts, training scales roughly linearly with the number of prompts. It is still presumably much cheaper in time and memory than fine-tuning the entire BERT model, which must back-propagate a much larger set of gradients.

### Metrics and Baselines

Our method outputs the most probable \(y\) given \((r,x)\). Here and in the supplementary material, we report its average performance on all test examples, with precision-at-1 (P@1), precision-at-10 (P@10) and mean reciprocal rank (MRR) as metrics. We measure the improvement from tuning LAMA, LPAQA, and random prompts. We also compare with AutoPrompt. Baseline numbers come from prior papers or our reimplementations.

### Results

Table 1 shows results on T-REx datasets obtained by querying three BERT-style models, with P@1 as the metric. Additional metrics and language models are shown in Tables 2 and 3 as well as Tables 5 and 6 in the supplementary material.

We consistently get large improvements by tuning the initial prompts. Remarkably, our method beats all prior methods even when throwing away the words of their informed prompts in favor of random initial vectors. It simply finds a prompt that works well on the \((x,y)\) training examples.

We conduct an ablation study where we adjust only the mixture weights (which are initially uni 

form) or only the word vectors in the prompts \({\bf t}\). As Table 4 shows, each helps, but the major benefit comes from tuning the word vectors to get soft prompts. Appendix C visualizes a set of soft prompts, and Appendix D analyzes the mixture weights. We also experiment on a challenging setting where the \(y\) labels are distinct for training and test (Appendix E in the supplementary materials), and find that soft prompts still yield some benefits.

The above results are for our basic method that tunes only the words of the prompt (i.e., layer 0). When we tune all layers--the "deeply perturbed prompts" of SS3.2--we typically obtain small additional gains, across various models and initializations, although tuning all layers does substantially hurt RoBERTa. These results are shown in Tables 5 and 6 in the supplementary material.

The tables show that the winning system--for _each_ combination of language model, T-REx dataset, and evaluation metric--_always_ uses a mixture of soft prompts initialized to mined prompts. It always tunes all layers, except with RoBERTa.

Finally, we also tried using data-dependent mixture weights as in SS3.4. This had little effect, because training learned to discard the \(x\) information by setting the temperature parameter \(T\) high.

## 5 Conclusion

Well-crafted natural language prompts are a powerful way to extract information from pretrained language models. In the case of cloze prompts used to query BERT and BART models for single-word answers, we have demonstrated startlingly large and consistent improvements from rapidly learning prompts that work--even though the resulting "soft prompts" are no longer natural language.

Our code and data are available at [https://github.com/hiaoxui/soft-prompts](https://github.com/hiaoxui/soft-prompts).

How about few-shot prediction with pretrained generative LMs? Here, Lewis et al. (2020b) show how to assemble a natural language prompt for input \(x\) from relevant input-output pairs \((x_{i},y_{i})\) selected by a trained retrieval model. Allowing fine-tuned _soft_ string pairs is an intriguing future possibility for improving such methods without needing to fine-tune the entire language model.

\begin{table}
\begin{tabular}{c|l l} \hline Model & T-REx orig. & T-REx ext. \\ \hline lama (BEb) & 31.1 & 26.4 \\ lpaqa(BEb) & 34.1 & 31.2 \\ AutoPrompt & 43.3 & 45.6 \\ Soft (sin., BEb) & 47.7 (**+16.6’**) & 49.6 (**+23.2’**) \\ Soft (min., BEb) & **50.7’(**+16.6’**) & **50.5’(**+19.3’**) \\ Soft (par., BEb) & 48.4 (**+12.8’**) & 49.7 (**+18.5’**) \\ Soft (ran., BEb) & 48.1 (**+47.4’**) & 50.6 (**+49.8**) \\ \hline lama (BEI) & 28.9† & 24.0† \\ lpapaq(BEI) & 39.4� & 37.8† \\ Soft (sin., BIel) & 51.1 (**+22.2**) & 51.4 (**+27.4**) \\ Soft (min., BEI) & **51.6 (**+12.2**) & **52.5 (**+14.7**) \\ Soft (par., BEI) & 51.1 (**+11.7**) & 51.7 (**+13.9**) \\ Soft (ran., BEI) & 51.9 (**+47.1**) & 51.9 (**+50.5**) \\ \hline AutoPrompt & 40.0 & - \\ Soft (min., Rob) & **40.6***(**+39.4**) & - \\ \hline \end{tabular}
\end{table}
Table 1: Results on T-REx datasets with P@1 as the metric. The “Soft” lines (our method) parenthetically show the improvement over the initial parameters (boldfaced if significant). In each subcolumn of comparable results, we boldface the best result along with all that are not significantly worse (sign test, \(p<0.02\)). (We marked a boldface number with ”2” if we lacked access to per-example output for one of the systems; differences from such systems were simply assumed to be significant.) † marks baseline results obtained from our reimplementations. In the Model column, BEb is BERT-base, BEI is BERT-large, Rob is RoBERTa-base.

\begin{table}
\begin{tabular}{c|l l l} \hline Model & P@1 & P@10 & MRR \\ \hline baseline & 39.4 & 67.4 & 49.1 \\ adjust mixture weights & 40.0 & 69.1 & 53.3 \\ adjust token vectors & 50.7 & 80.7 & 61.1 \\ adjust both & **51.0** & **81.4** & **61.6** \\ \hline \end{tabular}
\end{table}
Table 4: Ablation experiments, conducted with the BERT-large model on the T-REx original dataset.

\begin{table}
\begin{tabular}{c|l l l} \hline Model & P@1 & P@10 & MRR \\ \hline lama (BEb) & 9.7�  & 27.0�  & 15.6�  \\ lpaqa & 10.6�  & 23.7�  & 15.3�  \\ \hline Soft (sin.) & **11.2** (**+1.5**) **33.5** (**+ **6.5**) **18.9** (**+3.3**) \\ Soft (min.) & **12.9** (**+2.3**) **34.7** (**+11.0**) **20.3** (**+5.0**) \\ Soft (par.) & **11.5** (**+0.9**) **31.4** (**+ **7.7**) **18.3** (**+3.0**) \\ \hline \end{tabular}
\end{table}
Table 2: Results on Google-RE dataset obtained by querying the BERT-large-cased model.

\begin{table}
\begin{tabular}{c|l l l} \hline Model & P@1 & P@10 & MRR \\ \hline lama (BEb) & 0.1�  & 2.6�  & 1.5�  \\ lama (BEI) & 0.1�  & 2.6�  & 1.5�  \\ lama (BEI) & 0.1�  & 5.0�  & 1.9�  \\ \hline Soft (min.,BEb) & 11.3(**+11.2**) 36.4(**+33.8**) 19.3(**+17.8**) \\ Soft (ran.,BEb) & **11.8**(**+11.8**) **34.8**(**+31.9**) **19.8(**+19.6**) \\ Soft (min.,BIel) & **12.8**(**+12.7**) **37.0(**+32.0**) **20.9(**+19.0**) \\ Soft (ran.,BIel) & **14.5**(**+14.5**) **38.6(**+34.2**) **22.1(**+21.9**) \\ \hline \end{tabular}
\end{table}
Table 3: Results on ConceptNet (winner: random init).

 



## Acknowledgments

We thank the anonymous reviewers for helpful comments. This work was supported by DARPA KAIROS and by the National Science Foundation under Grant No. 1718846. The U.S. Government is authorized to reproduce and distribute reprints for governmental purposes. The views and conclusions contained in this publication are those of the authors, and should not be interpreted as representing official policies nor endorsement by the funding agencies or by Microsoft (where Dr. Eisner is also a paid employee, in an arrangement that has been reviewed and approved by the Johns Hopkins University in accordance with its conflict of interest policies).

## References

* Baroni et al. (2014) Marco Baroni, Georgiana Dinu, and German Kruszewski. 2014. Don't count, predict! A systematic comparison of context-counting vs. context-predicting semantic vectors. In _Association for Computational Linguistics (ACL)_, pages 238-247.
* Bisk et al. (2019) Yonatan Bisk, Rowan Zellers, Ronan Le Bras, Jianfeng Gao, and Yejin Choi. 2019. PIQA: Reasoning about physical commonsense in natural language. In _Association for the Advancement of Artificial Intelligence (AAAI)_.
* Bouraoui et al. (2020) Zied Bouraoui, Jose Camacho-Collados, and Steven Schockaert. 2020. Inducing relational knowledge from BERT. In _Association for the Advancement of Artificial Intelligence (AAAI)_, volume 34, pages 7456-7463.
* Broughton (1995) David Broughton. 1995. The assumptions and theory of public opinion polling. In _Public Opinion Polling and Politics in Britain_, pages 15-33. Springer.
* Brown et al. (2020) Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel M. Ziegler, Jeffrey Wu, Clemens Winter, Christopher Hesse, Mark Chen, Eric Sigler, Mateusz Litwin, Scott Gray, Benjamin Chess, Jack Clark, Christopher Berner, Sam McCandlish, Alce Radford, Ilya Sutskever, and Dario Amodei. 2020. Language models are few-shot learners.
* Devlin et al. (2019) J. Devlin, M. Chang, K. Lee, and K. Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language understanding. In _North American Association for Computational Linguistics (NAACL)_.
* Donaldson (1978) M. C. Donaldson. 1978. _Children's Minds_. W. W. Norton.
* Eichler et al. (2019) Max Eichler, Gazde Gul Sahin, and Iryna Gurevych. 2019. LINSPECTORWEB: A multilingual probing suite for word representations. In _Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP): System Demonstrations_, pages 127-132.
* Elsahar et al. (2018) Hady Elsahar, Pavlos Vougiouklis, Arslen Remaci, Christophe Gravier, Jonathon Hare, Elena Simperl, and Frederique Laforest. 2018. T-REx: A large scale alignment of natural language with knowledge base triples. In _Language Resources and Evaluation Conference (LREC)_, page 5.
* Hearst (1992) M. A. Hearst. 1992. Automatic acquisition of hyponyms from large text corpora. In _International Conference on Computational Linguistics (COLING)_.
* Jiang et al. (2020) Zhengbao Jiang, Frank F. Xu, Jun Araki, and Graham Neubig. 2020. How can we know what language models know? _Transactions of the Association for Computational Linguistics (TACL)_.
* Kingma and Ba (2015) D. P. Kingma and J. L. Ba. 2015. Adam: A method for stochastic optimization. In _International Conference on Learning Representations (ICLR)_, pages 1-15.
* Lample et al. (2016) Guillaume Lample, Miguel Ballesteros, Sandeep Subramanian, Kazuya Kawakami, and Chris Dyer. 2016. Neural architectures for named entity recognition. In _North American Association for Computational Linguistics and Human Language Technology (NAACL-HLT)_, pages 260-270.
* Lewis et al. (2020a) Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Ves Stoyanov, and Luke Zettlemoyer. 2020a. BART: Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension. In _Association for Computational Linguistics (ACL)_.
* Lewis et al. (2020b) Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich Kuttler, Mike Lewis, Wen tau Yih, Tim Rocktaschel, Sebastian Riedel, and Douwe Kiela. 2020b. Retrieval-augmented generation for knowledge-intensive NLP tasks. _arXiv preprint arXiv:2005.11401_.
* Li and Liang (2021) Xiang Lisa Li and Percy Liang. 2021. Prefixtuning: Optimizing continuous prompts for generation. _arXiv preprint arXiv:2101.00190_.
* Liu et al. (2021) Xiao Liu, Yanan Zheng, Zhengxiao Du, Ming Ding, Yujie Qian, Zhilin Yang, and Jie Tang. 2021. GPT understands, too. _arXiv preprint arXiv:2103.10385_

Y. Liu, M. Ott, N. Goyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. S. Zettlemoyer, and V. Stoyanov (2019)RoBERTa: a robustly optimized BERT pretraining approach. External Links: Link Cited by: SS4.
* Dave Orr (2013)50,000 lessons on how to read: A relation extraction corpus. Note: [https://github.com/google-research-datasets/relation-extraction-corpus](https://github.com/google-research-datasets/relation-extraction-corpus) Cited by: SS1.
* M. E. Peters, M. Neumann, M. Iyyer, M. Gardner, C. Clark, K. Lee, and L. S. Zettlemoyer (2018)Deep contextualized word representations. In North American Association for Computational Linguistics (NAACL), Cited by: SS1.
* F. Petroni, T. Rocktaschel, P. Lewis, A. Bakhtin, Y. Wu, A. H. Miller, and S. Riedel (2019)Language models as knowledge bases?. In Empirical Methods in Natural Language Processing (EMNLP), Cited by: SS1.
* A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, and I. Sutskever (2019)Language models are unsupervised multitask learners. External Links: Link Cited by: SS1.
* D. Rao, P. McNamee, and M. Dredze (2013)Entity linking: finding extracted entities in a knowledge base. In Multi-Source, Multilingual Information Extraction and Summarization, pp. 93-115. Cited by: SS1.
* E. Riloff and R. Jones (1999)Learning dictionaries for information extraction by multi-level bootstrapping. In Association for the Advancement of Artificial Intelligence (AAAI), pp. 474-479. Cited by: SS1.
* A. Rogers, O. Kovaleva, and A. Rumshisky (2020)A primer in BERTology: what we know about how BERT works. Transactions of the Association for Computational Linguistics (TACL). External Links: Link Cited by: SS1.
* K. Rose (1998)Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proceedings of the IEEE80, pp. 2210-2239. External Links: Document, ISSN 1674-787X Cited by: SS1.
* T. Schick and H. Schutze (2020)RLU's not just size that matters: small language models are also few-shot learners. arXiv preprint arXiv:2009.07118. Cited by: SS1.
* T. Schick and H. Schutze (2020)RLU's not just size that matters: small language models are also few-shot learners. arXiv preprint arXiv:2009.07118. Cited by: SS1.
* T. Shin, Y. Razeghi, R. L. Logan IV, E. Wallace, and Sameer Singh (2020)AutoPrompt: eliciting knowledge from language models with automatically generated prompts. In Empirical Methods in Natural Language Processing (EMNLP), Cited by: SS1.
* P. Singh, T. Lin, E. T. Mueller, G. Lim, T. Perkins, and W. Li Zhu (2002)Open mind common sense: knowledge acquisition from the general public. In On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE, Vol. 2519, pp. 1223-1237. External Links: ISBN 978-3-319- 

Statistics of Relational Databases

The statistics of the various relational databases are shown in Table 8.

## Appendix B Statistics of the Initial Prompts

Table 7 shows some statistics of the prompts we use to initialize the SoftPrompt model.

## Appendix C Visualization of Soft Prompts

Figure 1 shows what a mixture of soft prompts looks like when we tune only layer 0. The soft prompts are not too interpretable. The words closest to the tuned tokens (shown in blue) seem to be largely on the music topic. However, the soft templates do not seem to form meaningful phrases, nor is it obvious why they would prime for \(y\) to be an instrument when \(x\) is a musician.

## Appendix D Entropy of the Mixture Model

For any given relation \(r\), the entropy of the mixture weights is

\[H=\sum_{\mathbf{t}\in\mathcal{T}_{r}}p(\mathbf{t}~{}|~{}r)\cdot\log_{2}p( \mathbf{t}~{}|~{}r) \tag{3}\]

We then take \(2^{H}\in[1,|\mathcal{T}_{r}||]\) as a measure of the effective number of prompts that were retained. Table 10 shows some statistics of the effective number of prompts. In some cases, tuning the mixture weights essentially selected a single prompt, but on average, it settled on a mixture of several variant prompts (as illustrated by Figure 1).

## Appendix E Challenging dataset with distinct \(y\)'s

As described in SS4.3, we conducted an additional experiment to determine whether the prompts could generalize to novel \(y\) values. We conduct another experiment and ensure that there are no common \(y\) values among the train / dev / test sets. We use T-REx as the base relational database and split the datasets to make the ratio close to 80-10-10. The experiment results are shown in Table 9. We can observe that our method again improves the results, just as in Tables 5 and 6, which shows the generalizability of our method.

 



\begin{table}
\begin{tabular}{l|c l|l l l l|l l



\begin{table}
\begin{tabular}{c|r r r r} \hline \hline database & T-REx original & T-REx extended & Google-RE & ConceptNet \\ \hline \#relations & 41 & 41 & 3 & 16 \\ avg. \#unique \(x\) & 1580 & 834 & 1837 & 511 \\ avg. \#unique \(y\) & 217 & 151 & 372 & 507 \\ min \#\((x,y)\) & 544 & 310 & 766 & 510 \\ max \#\((x,y)\) & 1982 & 1000 & 2937 & 4000 \\ mean \#\((x,y)\) & 1715 & 885 & 1843 & 1861 \\ \hline \end{tabular}
\end{table}
Table 8: Statistics of the relational databases.

\begin{table}
\begin{tabular}{c|r r r r} \hline \hline Model & P@1 & P@10 & MRR \\ \hline lpaqa (BEb) & 18.9 & 40.4 & 26.6 \\ Soft (BEb) & **23.0 (+4.1)** & **45.2 (+4.8)** & **30.5 (+3.9)** \\ lpaqa (BEI) & 23.8 & 47.7 & 32.2 \\ Soft (BEl) & **27.0 (+3.2)** & **51.7 (+4.0)** & **35.4 (+3.2)** \\ \hline \hline \end{tabular}
\end{table}
Table 9: Results with distinct \(y\)’s. We use the BERT-base-cased and BERT-large-cased LMs and the LPAQA mining based prompts as initial prompts. The experiments are conducted on the T-REx original dataset.