SOTAVerified

Boosted Prompt Ensembles for Large Language Models

2023-04-12Code Available1· sign in to hype

Silviu Pitis, Michael R. Zhang, Andrew Wang, Jimmy Ba

Code Available — Be the first to reproduce this paper.

Reproduce

Code

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.

Tasks

Reproductions