Recent advancements have highlighted that large language models (LLMs), when given a small set of task-specific examples, demonstrate remarkable proficiency, a capability that extends to complex reasoning tasks. In particular, the combination of few-shot learning with the chain-of-thought (CoT) approach has been pivotal in steering models towards more logically consistent conclusions [Wei et al. 2022b]. This paper explores the optimization of example selection for designing effective CoT pre-prompts and shows that the choice of the optimization algorithm, typically in favor of comparison-based methods such as evolutionary computation, significantly enhances efficacy and feasibility. Specifically, thanks to a limited exploitative and overfitted optimization, Evolutionary Pre-Prompt Optimization (EPPO) brings an improvement over the naive few-shot approach, exceeding 10 absolute points in exact match scores on benchmark datasets such as GSM8k and MathQA. These gains are consistent across various contexts and are further amplified when integrated with self-consistency (SC).
@article{arxiv.2412.04291,
title = {Evolutionary Pre-Prompt Optimization for Mathematical Reasoning},
author = {Mathurin Videau and Alessandro Leite and Marc Schoenauer and Olivier Teytaud},
journal= {arXiv preprint arXiv:2412.04291},
year = {2026}
}
Comments
Revised and extended version. To appear in ACM Transactions on Evolutionary Learning and Optimization (TELO)