Revisiting OPRO: The Limitations of Small-Scale LLMs as Optimizers
Tuo Zhang, Jinyue Yuan, Salman Avestimehr

TL;DR
This paper critically examines the effectiveness of the OPRO prompting method when applied to small-scale LLMs, revealing limitations due to inference constraints and proposing alternative strategies for prompt engineering.
Contribution
It demonstrates the limited performance of OPRO on small-scale LLMs and recommends direct instructions as robust baselines for prompt engineering.
Findings
OPRO performs poorly on small-scale LLMs due to inference limitations.
Direct instructions are effective baseline prompts for small models.
Future prompting methods should balance model capabilities and computational costs.
Abstract
Numerous recent works aim to enhance the efficacy of Large Language Models (LLMs) through strategic prompting. In particular, the Optimization by PROmpting (OPRO) approach provides state-of-the-art performance by leveraging LLMs as optimizers where the optimization task is to find instructions that maximize the task accuracy. In this paper, we revisit OPRO for automated prompting with relatively small-scale LLMs, such as LLaMa-2 family and Mistral 7B. Our investigation reveals that OPRO shows limited effectiveness in small-scale LLMs, with limited inference capabilities constraining optimization ability. We suggest future automatic prompting engineering to consider both model capabilities and computational costs. Additionally, for small-scale LLMs, we recommend direct instructions that clearly outline objectives and methodologies as robust prompt baselines, ensuring efficient and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsPrivate Equity and Venture Capital
