arXiv:2505.16265cs.LG2025-05NeurIPS被引 13

让生成式奖励模型具备长程推理能力,提升对复杂任务的判断力。

Think-RM: Enabling Long-Horizon Reasoning in Generative Reward Models

  • 通过自引导思维链实现深度、灵活的推理过程
  • 在RM-Bench上比传统方法高8%准确率,支持复杂任务评估
  • 适合需要深度推理的RLHF对齐场景,如高阶决策任务

基于人类反馈的强化学习(RLHF)已成为对齐大语言模型与人类偏好的一种强大后训练范式。其核心挑战在于构建准确的奖励信号,传统布拉德利-特雷西奖励模型(BT RM)常因数据量和覆盖范围敏感,且易受奖励劫持影响。生成式奖励模型(GenRM)通过生成思维链(CoT)并输出最终奖励,提供了更鲁棒的替代方案。然而,现有GenRM依赖浅层、垂直扩展的推理,难以处理复杂或需深度推理的任务,且其成对偏好输出不兼容标准RLHF算法所需的点式奖励。本文提出Think-RM,通过建模内部思考过程,实现GenRM中的长程推理。不同于外部结构化理由,Think-RM生成灵活自引导的推理轨迹,支持自我反思、假设推理和发散推理。我们首先用长思维链数据进行监督微调(SFT)预热模型,再通过基于规则的强化学习(RL)进一步提升长程推理能力。此外,提出一种新型成对式RLHF流程,直接利用成对偏好奖励优化策略,无需转换为点式奖励,从而更高效利用Think-RM输出。实验表明,Think-RM在RM-Bench上达到当前最优表现,优于BT RM和垂直扩展的GenRM 8%。结合该成对式流程,其端到端策略性能显著超越传统方法。

原文摘要 · Abstract (English)

Reinforcement learning from human feedback (RLHF) has become a powerful post-training paradigm for aligning large language models with human preferences. A core challenge in RLHF is constructing accurate reward signals, where the conventional Bradley-Terry reward models (BT RMs) often suffer from sensitivity to data size and coverage, as well as vulnerability to reward hacking. Generative reward models (GenRMs) offer a more robust alternative by generating chain-of-thought (CoT) rationales followed by a final reward. However, existing GenRMs rely on shallow, vertically scaled reasoning, limiting their capacity to handle nuanced or complex (e.g., reasoning-intensive) tasks. Moreover, their pairwise preference outputs are incompatible with standard RLHF algorithms that require pointwise reward signals. In this work, we introduce Think-RM, a training framework that enables long-horizon reasoning in GenRMs by modeling an internal thinking process. Rather than producing structured, externally provided rationales, Think-RM generates flexible, self-guided reasoning traces that support advanced capabilities such as self-reflection, hypothetical reasoning, and divergent reasoning. To elicit these reasoning abilities, we first warm-up the models by supervised fine-tuning (SFT) over long CoT data. We then further improve the model's long-horizon abilities by rule-based reinforcement learning (RL). In addition, we propose a novel pairwise RLHF pipeline that directly optimizes policies using pairwise preference rewards, eliminating the need for pointwise reward conversion and enabling more effective use of Think-RM outputs. Experiments show that Think-RM achieves state-of-the-art results on RM-Bench, outperforming both BT RM and vertically scaled GenRM by 8%. When combined with our pairwise RLHF pipeline, it demonstrates superior end-policy performance compared to traditional approaches.

奖励模型长程推理RLHF生成式模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。