Exploit More, Explore Smarter for Budget-Constrained Agentic Search

arXiv:2608.23848v1 Announce Type: new Abstract: Budget-constrained agentic search arises when an LLM agent must refine candidates under a small evaluation budget, because validation is expensive, generation requires multiple model calls, or both. In this regime, standard MCTS allocates budget poorly: exploration bonuses dominate at low visit counts, unpromising siblings are expanded before promising chains can deepen, and branching is independent of node quality. We introduce ExTS, a tree-search policy that treats expansion itself as a value-of-information decision. ExTS combines three mechanisms: discriminative reward shaping to separate candidates under narrow score distributions, a stochastic virtual child that estimates the value of creating a new branch from the parent's reward history, and quality-conditioned branching that expands only when a node's score justifies the budget cost. Across prompt optimization, code generation, molecular structure elucidation, and agentic workflow optimization, ExTS is competitive with or improves over task-specific tree-search baselines, with an average relative gain of +5.5% using a single fixed configuration. We further introduce pilot-run diagnostics that characterize what makes budget-constrained agentic search problems structurally different from one another, providing both understanding of the problem space and practical guidance for adaptation.

Related

• MicroEvo: Knowledge-Guided LLM Sampling for Efficient Microarchitecture Design Space Exploration
• Agentic Transformers Provably Learn to Search via Reinforcement Learning
• Self-Improvement Imitation with Biologically Guided Search for Protein Design Under Oracle Budgets
• NeurGO: Learning to Generate Elite Candidates for Meta-Black-Box Expensive Optimization

Source: arXiv cs.AI | 2026-08-26