Ask Me Anything: A simple strategy for prompting language models
Simran Arora Affiliation: Stanford University Avanika Narayan Affiliation: Stanford University Mayee F. Chen Affiliation: Stanford University Laurel Orr Affiliation: Stanford University Neel Guha Affiliation: Stanford University Kush Bhatia Affiliation: Stanford University Ines Chami Affiliation: Numbers Station Frederic Sala Affiliation: University of Wisconsin-Madison Christopher Ré Affiliation: Stanford University
Abstract
Large language models (LLMs) transfer well to new tasks out-of-the-box simply given a natural language prompt that demonstrates how to perform the task and no additional training. Prompting is a brittle process wherein small modifications to the prompt can cause large variations in the model predictions, and therefore significant effort is dedicated towards designing a painstakingly perfect prompt for a task. To mitigate the high degree of effort involved in prompting, we instead ask whether collecting multiple effective, yet imperfect, prompts and aggregating them can lead to a high quality prompting strategy. Our observations motivate our proposed prompting method, Ask Me Anything Prompting (AMA). We first develop an understanding of the effective prompt formats, finding question-answering (QA) prompts, which encourage open-ended generation (“Who went to the park?”) tend to outperform those that restrict the model outputs (“John went to the park. Output True or False”). Our approach recursively uses the LLM to transform task inputs to the effective QA format. We apply these prompts to collect several noisy votes for the input’s true label. We find that these prompts can have very
原文 arXiv:2210.02441;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2210.02441v3