arXiv AI By Tal Oved, Roi Pony, Oshri Naparstek, Udi Barzelay

Evolution or Illusion? Rethinking Evaluation in LLM Evolutionary Search

Read the original on arXiv AI →

The paper critiques the common practice of evaluating large‑language‑model (LLM) evolutionary search methods using a single seed and fixed iteration budget, arguing that this approach is insufficient. By testing three search strategies across five optimization tasks and varying both the number of seeds (width) and iterations (depth), the authors find that optimal budget allocation depends on the strategy, task, and total budget, and that strategy rankings shift with different budgets. They propose a measurement protocol that maps the seeds‑by‑iterations frontier and offers practical guidance for researchers.

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 26

Exploit More, Explore Smarter for Budget-Constrained Agentic Search

The paper introduces ExTS, a tree‑search policy designed for budget‑constrained agentic search where evaluation and generation costs are high. ExTS treats expansion as a value‑of‑information decision, combining discriminative reward shaping, a stochastic virtual child, and quality‑conditioned branching to allocate budget more effectively. Experiments on prompt optimization, code generation, molecular structure elucidation, and agentic workflow optimization show ExTS matching or surpassing task‑specific baselines with an average gain of +5.5% using a single configuration, and the authors also present pilot‑run diagnostics to guide adaptation to different problem structures.

By Haoyang Fang, Bernie Wang