A Bayesian 'knowledge gradient' policy for sequentially choosing which prompts to evaluate finds better language-model prompts within 30 evaluations than evolutionary, bandit, and greedy baselines on instruction-induction tasks.
Optimal information blending with measurements in the l 2 sphere
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Sequential Optimal Learning Approach to Automated Prompt Engineering in Large Language Models
A Bayesian 'knowledge gradient' policy for sequentially choosing which prompts to evaluate finds better language-model prompts within 30 evaluations than evolutionary, bandit, and greedy baselines on instruction-induction tasks.