mlsanityData to 7 Oct 2026

ResponseRank: Data-Efficient Reward Modeling through Preference Strength Learning

arXiv 2512.25023 ↗First posted 31 Dec 2025cs.LGcited by 1

On the map: LLM alignment / RLHF / preference optimisation → Reward modeling and RLHF

Abstract (arXiv)

Binary choices, as often used for reinforcement learning from human feedback (RLHF), convey only the direction of a preference. A person may choose apples over oranges and bananas over grapes, but which preference is stronger? Strength is crucial for decision-making under uncertainty and generalization of preference models, but hard to measure reliably. Metadata such as response times and inter-annotator agreement can serve as proxies for strength, but are often noisy and confounded. We propose ResponseRank to address the challenge of learning from noisy strength signals. Our method uses relative differences in proxy signals to rank responses to pairwise comparisons by their inferred preference strength. To control for systemic variation, we compare signals only locally within carefully constructed strata. This enables robust learning of utility differences consistent with strength-derived rankings while making minimal assumptions about the strength signal. Our contributions are threefold: (1) ResponseRank, a novel method that robustly learns preference strength by leveraging locally valid relative strength signals; (2) empirical evidence of improved sample efficiency and robustness across diverse tasks: synthetic preference learning (with simulated response times), language modeling (with annotator agreement), and RL control tasks (with simulated episode returns); and (3) the Pearson Distance Correlation (PDC), a novel metric that isolates cardinal utility learning from ordinal accuracy.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Reward modeling and RLHF, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 4 of its 68 references that are in the map. First posted on arXiv 31 Dec 2025.

Builds on

4 of 68 references.

Closest ancestors · 2

Same direction, newest first

  1. 2025RewardBench 2: Advancing Reward Model Evaluation2 Jun
  2. 2024Rethinking Bradley-Terry Models in Preference-Based Reward Modeling: Foundations, Theory, and Alternatives7 Nov

Other references · 2

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2024The Llama 3 Herd of Modelscited by 14,192

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Preference Learning with Response Time: Robust Losses and Guarantees
  2. 2024Reward Learning From Preference With Ties
  3. 2024Enhancing Preference-based Linear Bandits via Human Response Time
  4. 2026Beyond Binary Preferences: A Principled Framework for Reward Modeling with Ordinal Feedback
  5. 2026Reinforcement Learning from Human Feedback: A Statistical Perspective
  6. 2024Online Self-Preferring Language Models
  7. 2024Data-Centric Human Preference with Rationales for Direct Preference Alignment
  8. 2025Capturing Individual Human Preferences with Reward Features