Preference Learning with Response Time: Robust Losses and Guarantees
Ayush Sawarni, Sahasrajit Sarmasarkar, Vasilis Syrgkanis

TL;DR
This paper introduces a novel approach to preference learning that incorporates response time data, improving reward model accuracy and efficiency through new loss functions and theoretical guarantees, especially for complex reward functions.
Contribution
It proposes response time-augmented preference learning methods with Neyman-orthogonal losses, providing theoretical guarantees and improved sample efficiency over traditional approaches.
Findings
Response time data enhances reward model learning.
The proposed methods achieve oracle convergence rates.
Significant reduction in error scaling from exponential to polynomial.
Abstract
This paper investigates the integration of response time data into human preference learning frameworks for more effective reward model elicitation. While binary preference data has become fundamental in fine-tuning foundation models, generative AI systems, and other large-scale models, the valuable temporal information inherent in user decision-making remains largely unexploited. We propose novel methodologies to incorporate response time information alongside binary choice data, leveraging the Evidence Accumulation Drift Diffusion (EZ) model, under which response time is informative of the preference strength. We develop Neyman-orthogonal loss functions that achieve oracle convergence rates for reward model learning, matching the theoretical optimal rates that would be attained if the expected response times for each query were known a priori. Our theoretical analysis demonstrates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsDiffusion
