arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2504.02495cs.CLcs.AIcs.LG
收藏

通用奖励建模的推理时扩展

Inference-Time Scaling for Generalist Reward Modeling

DeepSeek-AI;Dept. of Computer Sci. & Tech., Tsinghua University(计算机科学与技术系,清华大学);Institute for AI Industry Research (AIR), Tsinghua University(人工智能产业研究院(AIR),清华大学)

Zijun Liu, Peiyi Wang, Runxin Xu, Shirong Ma, Chong Ruan, Peng Li, Yang Liu, Yu Wu

AI总结:

本研究提出自原则批评微调(SPCT)与并行采样及元RM投票机制,实现通用奖励建模的推理时扩展,显著提升奖励模型质量与可扩展性。

摘要:

强化学习(RL)已被广泛用于大规模语言模型(LLM)的后训练。近期,RL对LLM推理能力的激励表明,适当的学习方法能够实现有效的推理时扩展。RL的一个关键挑战是在可验证问题或人工规则之外的各个领域为LLM获取准确的奖励信号。在本工作中,我们研究如何通过更多的推理计算来改进通用查询的奖励建模(RM),即通用RM的推理时可扩展性,并进一步研究如何通过适当的学习方法来提高性能-计算扩展的有效性。对于RM方法,我们采用逐点生成式奖励建模(GRM)以适应不同的输入类型并具备推理时扩展的潜力。对于学习方法,我们提出了自原则批评微调(SPCT),通过在线RL促进GRM中可扩展的奖励生成行为,自适应地生成原则并准确地进行批评,从而得到DeepSeek-GRM模型。此外,为了实现有效的推理时扩展,我们使用并行采样来扩展计算使用,并引入一个元RM来引导投票过程以获得更好的扩展性能。实验上,我们表明SPCT显著提高了GRM的质量和可扩展性,在各种RM基准上优于现有方法和模型,且没有严重偏差,并且可以获得比训练时扩展更好的性能。DeepSeek-GRM在某些任务上仍面临挑战,我们相信这些挑战可以通过未来在通用奖励系统方面的努力来解决。模型已在Hugging Face和ModelScope上发布。

英文摘要:

Reinforcement learning (RL) has been widely adopted in post-training for large language models (LLMs) at scale. Recently, the incentivization of reasoning capabilities in LLMs from RL indicates that $\textit{proper learning methods could enable effective inference-time scalability}$. A key challenge of RL is to obtain accurate reward signals for LLMs in various domains beyond verifiable questions or artificial rules. In this work, we investigate how to improve reward modeling (RM) with more inference compute for general queries, i.e. the $\textbf{inference-time scalability of generalist RM}$, and further, how to improve the effectiveness of performance-compute scaling with proper learning methods. For the RM approach, we adopt pointwise generative reward modeling (GRM) to enable flexibility for different input types and potential for inference-time scaling. For the learning method, we propose Self-Principled Critique Tuning (SPCT) to foster scalable reward generation behaviors in GRMs through online RL, to generate principles adaptively and critiques accurately, resulting in $\textbf{DeepSeek-GRM}$ models. Furthermore, for effective inference-time scaling, we use parallel sampling to expand compute usage, and introduce a meta RM to guide voting process for better scaling performance. Empirically, we show that SPCT significantly improves the quality and scalability of GRMs, outperforming existing methods and models in various RM benchmarks without severe biases, and could achieve better performance compared to training-time scaling. DeepSeek-GRM still meets challenges in some tasks, which we believe can be addressed by future efforts in generalist reward systems. The models are released at Hugging Face and ModelScope.

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

↑