Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs

Sora Miyamoto, Daisuke Oba, Naoaki Okazaki

Tree-search decoding is an effective form of test-time scaling for large language models (LLMs), but real-world deployment often imposes a fixed per-query token budget that varies…