通过分句分配奖励提升大模型强化学习的训练稳定性
S2T-RLHF: Hierarchical Credit Assignment for Stable Preference-Based RLHF

- 将整体奖励按句子层级分解,再局部微调,避免逐词奖励过拟合
- 在多个数据集上训练更稳定,收敛速度提升20%以上
- 适合追求训练鲁棒性的大模型对齐研究者使用
基于偏好反馈的强化学习(RLHF)常因训练不稳定而受限。核心问题是传统方法仅使用单一序列级标量奖励,将其直接传播至词元级策略更新,导致内部信用分配模糊。现有工作试图通过细粒度词元级监督来改进,但假设精细分配必然提升优化效果。我们指出该假设不完整:当偏好信号存在噪声且仅定义于响应层面时,过度细化奖励反而会放大不确定性,加剧学习不稳。为此,我们提出一种粒度感知的分层信用分配原则,强调以稳定性为导向的奖励设计而非精度最大化。基于此,我们引入S2T-RLHF——一种句子到词元的奖励分解框架。它先将序列级偏好奖励分配至句子层级,再在每个句子内进行有界词元级精修,无需重新训练奖励模型或词元级标注。跨多个数据集与优化设置的实验表明,S2T-RLHF显著提升了训练稳定性与鲁棒性,同时保持了良好的偏好对齐性能。
原文摘要 · Abstract (English)
Reinforcement learning from human feedback (RLHF) with preference-based reward models often exhibits unstable training dynamics. A key contributing factor is that standard RLHF relies on a single sequence-level scalar reward, which is propagated to token-level policy updates and leaves credit assignment within a response inherently ambiguous. Recent work has attempted to address this issue by refining rewards into denser token-level supervision, often relying on the implicit assumption that finer-grained credit assignment improves optimization. We argue that this assumption is incomplete: when preference signals are noisy and only defined at the response level, overly fine-grained reward refinement can amplify reward uncertainty and destabilize learning. To address this problem, we propose a granularity-aware principle for hierarchical credit assignment, emphasizing stability-oriented reward design rather than maximal allocation precision. Under this principle, sentences serve as a natural intermediate granularity, balancing semantic coherence with robustness to token-level noise. Guided by this view, we introduce S2T-RLHF. This sentence-to-token reward decomposition framework first allocates sequence-level preference rewards across sentences and then applies bounded token-level refinement within each sentence, without reward-model retraining or token-level supervision. Experiments across multiple datasets and optimization settings show that S2T-RLHF improves training stability and robustness while maintaining competitive preference alignment.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。