arXiv:2603.23184cs.CLcs.AI2026-03被引 2

用点击复制等隐式数据训练无偏奖励模型,降低对人工标注的依赖。

ImplicitRM: Unbiased Reward Modeling from Implicit Preference Data for LLM alignment

  • 通过分层建模将数据分为四类,解决隐式反馈缺少负样本问题。
  • 理论证明其学习目标无偏,能在多个数据集上准确建模奖励。
  • 适合研究低成本奖励建模或大模型对齐的从业者使用。

奖励建模是语言模型对齐中强化学习从人类反馈(RLHF)面临的一个长期挑战。当前方法严重依赖高成本的人工反馈数据。本文研究从隐式人类反馈(如点击、复制)中学习奖励模型的可行性,作为低成本替代方案。我们识别出两个核心挑战:(1) 隐式偏好数据缺乏明确的负样本,导致标准正负分类方法失效;(2) 隐式反馈存在用户偏好偏差,不同回复产生反馈的概率不同,加剧了负样本识别难度。为此,我们提出 ImplicitRM,旨在从隐式偏好数据中学习无偏奖励模型。ImplicitRM 通过分层模型将训练样本划分为四个潜在组别,并基于似然最大化推导学习目标,理论上可保证无偏性,有效解决上述两个问题。实验表明,ImplicitRM 在多个隐式偏好数据集上均能学习到准确的奖励模型。代码已开源。

原文摘要 · Abstract (English)

Reward modeling represents a long-standing challenge in reinforcement learning from human feedback (RLHF) for aligning language models. Current reward modeling is heavily contingent upon experimental feedback data with high collection costs. In this work, we study \textit{implicit reward modeling} -- learning reward models from implicit human feedback (e.g., clicks and copies) -- as a cost-effective alternative. We identify two fundamental challenges in implicit reward modeling: (1) Implicit preference data lacks definitive negative samples, which makes standard positive-negative classification methods inapplicable; (2) Implicit preference data suffers from user preference bias, where different responses have different propensities to elicit user feedback actions, which exacerbates the difficulty of distinguishing definitive negative samples. To address these challenges, we propose ImplicitRM, which aims to learn unbiased reward models from implicit preference data. ImplicitRM stratifies training samples into four latent groups via a stratification model. Building on this, it derives a learning objective through likelihood maximization, which we prove is theoretically unbiased, effectively resolving both challenges. Experiments demonstrate that ImplicitRM learns accurate reward models across implicit preference datasets. Code is available on our project website.

奖励建模隐式反馈大模型对齐

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