arXiv AI By Haoyue Liu, Zhichao Wang, Huanyu Yan, Xiaoying Tang

How Should a Prompt Optimizer Spend a Tight Budget? BudgetAPO with Noise-Adaptive Evaluation

Read the original on arXiv AI →

The paper introduces BudgetAPO, a single‑stage prompt optimizer designed for tight‑budget scenarios where only a few hundred model calls are feasible. BudgetAPO adapts the evaluation slice size to each task’s noise level, uses a fixed slice to turn accept/reject decisions into paired comparisons, and applies a reflective operator to jointly rewrite reasoning strategy and output format. Across seven benchmarks and five subject models, BudgetAPO outperforms existing methods, ranking first on every subject and requiring far fewer calls to achieve comparable or superior performance.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 12

RLMOpt: Adaptive Prompt Optimization via Recursive Language Models

arXiv:2608. 10471v1 Announce Type: new Abstract: Prompt optimizers automate the search for prompts that improve language-model performance, but existing methods rely on a predefined optimization procedure: the algorithm determines which candidates to explore and how the search progresses, while the language model generates or refines prompt proposals.

By Subhash Bangalore Satheesha, Nirvik Pande, Deepthi Duddempudi, Bharath Dandala
arXiv Machine Learning
Oct 3

How Much Can Language Models Gain from Test-Time Computation?

The paper investigates how test‑time computation can enhance language models and at what cost, introducing the SELF‑POT benchmark to evaluate this across competition mathematics, competitive programming, and agentic workflows. SELF‑POT separates candidate coverage from final accuracy, tracks correctness transitions under revision, and measures protocol completion alongside task success. Using a unified budget rule, the study compares direct inference, parallel sampling, and self‑revision across five low‑cost reasoning models, revealing that selection rules and failure handling significantly influence gains and cost savings.

By Bangji Yang, Jingyuan Li, Jiajun Fan, Yi Evie Zhang, Ruihan Guo, Hongba Ma, Neil He, Chumeng Liang, Qinglong Zheng, Zhanghan Ni, Ge Liu
arXiv AI
Oct 2

Benchmarking Prompt Optimization of Large Language Models With Chess

arXiv:2610. 00416v1 Announce Type: new Abstract: Evaluating large language models becomes increasingly challenging as their capabilities advance: benchmarks can saturate, public test sets risk contamination, and assessing harder tasks can require expensive grading or execution infrastructure.

By Timoth\'ee Lesort, Alejandra L\'opez de Aberasturi G\'omez, Tristan Karch, Tom Veniat, Philippe Modard, Karl Tuyls, Ludovic Denoyer