arXiv AI By Haoyang Fang, Bernie Wang

Exploit More, Explore Smarter for Budget-Constrained Agentic Search

Read the original on arXiv AI →

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.

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
1d ago

Uncertainty-Aware Budget Allocation for Efficient LLM Tree Search

The paper introduces Uncertainty-Aware Allocation (UAA), a training‑free framework that adjusts the per‑step budget in large language model tree search based on sibling action dispersion. By estimating uncertainty from sibling dispersion, UAA decouples value from uncertainty, allowing selective expansion and pruning. Experiments on mathematical reasoning, logical reasoning, and planning tasks show that UAA can cut token usage by up to 90% and latency by up to 9× while maintaining comparable accuracy across multiple tree search algorithms and both open‑ and closed‑source LLMs.

By Jianguo Huang, Zhiyi Lyu, Fuxiang Zhang, Yanchen Deng, Deheng Ye, Bo An