arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.01485cs.LGstat.ML
收藏

通过奖励尾部引导搜索预测并改进测试时间扩展规律

Predicting and improving test-time scaling laws via reward tail-guided search

Department of Statistical Sciences, University of Toronto(多伦多大学统计科学系);Department of AI and Data Science, University of Hong Kong(香港大学人工智能与数据科学系)

Muheng Li, Jian Qian, Wenlong Mou

AI总结:

本文提出通过奖励尾部引导搜索预测并改进LLM测试时间扩展规律,通过动态分配计算资源提升推理能力。

摘要:

测试时间扩展已成为增强大型语言模型(LLM)推理能力的关键途径。尽管简单的''最佳的N''(BoN)策略已经展示了显著的性能提升,但缺乏在N的选择、预算分配和多阶段决策上的系统指导,因此仍有大量优化空间。虽然许多工作探讨了这种优化,但严格的理论保证仍然有限。在本文中,我们提出新的方法来通过尾部引导搜索预测和改进扩展特性。通过估计奖励尾部分布,我们的方法可以在不进行详尽评估的情况下预测LLM的扩展规律。利用这一预测工具,我们引入了扩展律引导(SLG)搜索,一种新的测试时间算法,能够动态分配计算资源以识别和利用具有最高预测潜力的中间状态。我们理论证明SLG在与完美信息 oracle 相比时达到消失的后悔,并且在使用BoN时所需的计算预算更大时,能够实现预期奖励。实证上,我们验证了我们的框架在不同LLM和奖励模型上的有效性,确认尾部引导分配在相同计算预算下比最佳的N获得更高的奖励产出。我们的代码可在https://github.com/PotatoJnny/Scaling-Law-Guided-search上获取。

英文摘要:

Test-time scaling has emerged as a critical avenue for enhancing the reasoning capabilities of Large Language Models (LLMs). Though the straight-forward ''best-of-$N$'' (BoN) strategy has already demonstrated significant improvements in performance, it lacks principled guidance on the choice of $N$, budget allocation, and multi-stage decision-making, thereby leaving substantial room for optimization. While many works have explored such optimization, rigorous theoretical guarantees remain limited. In this work, we propose new methodologies to predict and improve scaling properties via tail-guided search. By estimating the tail distribution of rewards, our method predicts the scaling law of LLMs without the need for exhaustive evaluations. Leveraging this prediction tool, we introduce Scaling-Law Guided (SLG) Search, a new test-time algorithm that dynamically allocates compute to identify and exploit intermediate states with the highest predicted potential. We theoretically prove that SLG achieves vanishing regret compared to perfect-information oracles, and achieves expected rewards that would otherwise require a polynomially larger compute budget required when using BoN. Empirically, we validate our framework across different LLMs and reward models, confirming that tail-guided allocation consistently achieves higher reward yields than Best-of-$N$ under identical compute budgets. Our code is available at https://github.com/PotatoJnny/Scaling-Law-Guided-search.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑