Boosted Prompt Ensembles for Large Language Models

Silviu Pitis, Michael R. Zhang, Andrew Wang, Jimmy Ba
4/12/2023
cs.CLcs.LG

No official code found. Best implementation: awwang10/llmpromptboosting (31 stars, last commit 2023-04-13).

Abstract

Methods such as chain-of-thought prompting and self-consistency have pushed the frontier of language model reasoning performance with no additional training. To further improve performance, we propose a prompt ensembling method for large language models, which uses a small dataset to construct a set of few shot prompts that together comprise a ``boosted prompt ensemble''. The few shot examples for each prompt are chosen in a stepwise fashion to be ``hard'' examples on which the previous step's ensemble is uncertain. We show that this outperforms single-prompt output-space ensembles and bagged prompt-space ensembles on the GSM8k and AQuA datasets, among others. We propose both train-time and test-time versions of boosted prompting that use different levels of available annotation and conduct a detailed empirical study of our algorithm.

View on arXivView PDF

Code Implementations(1)

Accompanying code for "Boosted Prompt Ensembles for Large Language Models"

315TeX, PythonApr 12, 20233 years ago

Cite this paper

@article{pitis2023boosted,
  title  = {Boosted Prompt Ensembles for Large Language Models},
  author = {Silviu Pitis and Michael R. Zhang and Andrew Wang and Jimmy Ba},
  year   = {2023},
  eprint = {2304.05970},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.05970v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.05970.svg)](https://codeofpaper.com/paper/2304.05970)

Discussion