AINeutralarXiv – CS AI · 9h ago6/10
🧠
Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs
Researchers propose Budget-Guided MCTS, a tree-search algorithm that optimizes large language model inference by dynamically adjusting exploration and refinement strategies based on remaining token budgets. The method addresses a practical deployment challenge where fixed computational budgets vary across use cases, outperforming budget-agnostic approaches on mathematical and physics reasoning tasks.