Logo Logo
Help
Contact
Switch Language to German

Kaufmann, Timo ORCID logoORCID: https://orcid.org/0000-0001-5193-8574; Metz, Yannick; Keim, Daniel A. und Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (December 2025): ResponseRank: Data-Efficient Reward Modeling through Preference Strength Learning. 39th Conference on Neural Information Processing Systems (NeurIPS 2025), San Diego, CA, USA, 2.- 7. December 2025. Advances in Neural Information Processing Systems. Vol. 38 San Diego, CA, USA: [PDF, 2MB]

[thumbnail of 23475_ResponseRank_Data_Effici.pdf]
Preview
Creative Commons Attribution
Published Version

Abstract

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 interannotator 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 strengthderived 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.

Actions (login required)

View Item View Item