atlas

Research map / Reinforcement learning / RL from feedback

ResponseRank: Data-Efficient Reward Modeling through Preference Strength Learning

NeurIPS 2025 · Reinforcement learning › RL from feedback · approach: Reward modeling versus direct optimization · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes ResponseRank, which ranks pairwise comparisons by inferred preference strength using locally stratified response-time or annotator-agreement signals under a Plackett-Luce loss, plus the PDC metric for cardinal utility learning.

Problem

Binary preference labels in RLHF convey only preference direction, not preference strength, which is needed for decision-making under uncertainty and better reward model generalization; strength proxies like response times are noisy and confounded.

Approach

Stratify comparisons (e.g., per annotator), sort comparisons within each stratum by a noisy strength proxy, and train a utility model with a Plackett-Luce ranking loss over signed utility differences against a virtual zero anchor; reduces to Bradley-Terry for single-comparison strata.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use inter-annotator agreement as the strength signalResponseRank on MultiPref · MultiPref testaccuracyHelped
Use inter-annotator agreement as the strength signalResponseRank on MultiPref · RewardBench 2performance: +3.0{} pp improvement over BTHelped
Use inter-annotator agreement as the strength signalResponseRank on MultiPref · RewardBench 2preference pairs to match final BT performance: approximately 30\% fewer preference pairsHelped
Use response time stratified by annotatorResponseRank on MultiPref · MultiPrefperformanceHurt
Use stated strength labels (slight/clear) instead of random strength rankingsResponseRank on MultiPref · RewardBench 2performance: +0.6{} pp over BT; $p= 0.414$Helped
Use random strength rankings of size 2 (ablation)ResponseRank on MultiPref · MultiPref testaccuracyHelped
Use random strength rankings of size 2 (ablation)ResponseRank on MultiPref · RewardBench 2performanceHurt
Train with BT loss for two epochs instead of three (ablation)BT on MultiPref · MultiPref testperformanceHelped
Train with BT loss for three epochs instead of two (ablation)BT on MultiPref · RewardBench 2performanceHelped
Permute response times (ablation)ResponseRank on synthetic preference datasets · Synthetic datasetsPearson Distance Correlation (PDC)Hurt
Permute response times (ablation)ResponseRank on synthetic preference datasets · Synthetic datasetschoice accuracyHurt
Pool all comparisons into one global stratum instead of stratifying (ablation)ResponseRank on synthetic preference datasets · Synthetic datasetsperformanceHurt

Surprising findings

Limitations

Experimental setup

Datasets: MultiPref RewardBench 2 MuJoCo HalfCheetah MuJoCo Swimmer MuJoCo Walker2d Highway merge-v0 synthetic preference data

Benchmarks: MultiPref RewardBench 2 synthetic preference benchmarks

Metrics: Pearson Distance Correlation choice accuracy RewardBench 2 score policy return

Baselines: Bradley-Terry RtRegression ResponseRank-Perm ResponseRank-Pool BT@2 RR-Random

Builds on: Bradley-Terry Plackett-Luce BT-Regression

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy