Preference Learning with Response Time episode artwork

EPISODE · Jun 2, 2025 · 22 MIN

Preference Learning with Response Time

from Best AI papers explained · host Enoch H. Kang

This academic paper introduces a new approach to preference learning by incorporating response time data alongside traditional binary choices. The authors highlight that while standard preference learning relies solely on which option a user prefers, the speed of the decision can provide valuable information about the strength of that preference. They propose novel methodologies, including a Neyman-orthogonal loss function, to leverage response time information based on the Evidence Accumulation Drift Diffusion model. Their theoretical analysis and experiments, including those on image-based preference tasks, demonstrate that this response time-augmented method significantly improves the sample efficiency and accuracy of learning human preferences compared to using only binary choice data. The research shows improved performance for both linear and non-linear reward models.

Episode metadata supplied by the publisher feed · Published Jun 2, 2025

Embed this episode

NOW PLAYING

Preference Learning with Response Time

0:00 22:07

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Best AI papers explained?

This episode is 22 minutes long.

When was this Best AI papers explained episode published?

This episode was published on June 2, 2025.

Can I download this Best AI papers explained episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!