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

Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs arXiv:2602.09574v2 Announce Type: replace Abstract: 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 across settings. Existing tree-search policies are largely budget-agnostic, treating the budget merely as a termination condition, thereby risking late-stage over-branching or prematu