mlsanityData to 7 Oct 2026

Enhancing Preference-based Linear Bandits via Human Response Time

arXiv 2409.05798 ↗First posted 9 Sep 2024cs.LG cs.AI cs.HCcited by 3

Not on the map. Why?

Abstract (arXiv)

Interactive preference learning systems infer human preferences by presenting queries as pairs of options and collecting binary choices. Although binary choices are simple and widely used, they provide limited information about preference strength. To address this, we leverage human response times, which are inversely related to preference strength, as an additional signal. We propose a computationally efficient method that combines choices and response times to estimate human utility functions, grounded in the EZ diffusion model from psychology. Theoretical and empirical analyses show that for queries with strong preferences, response times complement choices by providing extra information about preference strength, leading to significantly improved utility estimation. We incorporate this estimator into preference-based linear bandits for fixed-budget best-arm identification. Simulations on three real-world datasets demonstrate that using response times significantly accelerates preference learning compared to choice-only approaches. Additional materials, such as code, slides, and talk video, are available at https://shenlirobot.github.io/pages/NeurIPS24.html

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 23 of its 86 references that are in the map. First posted on arXiv 9 Sep 2024.

Builds on

23 of 86 references.

References · 23

  1. 2022Training language models to follow instructions with human feedbackcited by 15,712
  2. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,634
  3. 2020Learning to summarize from human feedbackcited by 2,562
  4. 2021WebGPT: Browser-assisted question-answering with human feedbackcited by 1,722
  5. 2022Teaching language models to support answers with verified quotescited by 290
  6. 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 280
  7. 2013Bandits with Knapsackscited by 163
  8. 2018Preference-based Online Learning with Dueling Bandits: A Surveycited by 100
  9. 2019Sequential Experimental Design for Transductive Linear Banditscited by 88
  10. 2020Gamification of Pure Exploration for Linear Banditscited by 61
  11. 2021High-Dimensional Experimental Design and Kernel Banditscited by 55
  12. 2017MNL-Bandit: A Dynamic Learning Approach to Assortment Selectioncited by 50
11 more
  1. 2021Minimax Optimal Fixed-Budget Best Arm Identification in Linear Banditscited by 32
  2. 2020Improved Confidence Bounds for the Linear Logistic Model and Applications to Linear Banditscited by 31
  3. 2021Learning Reward Functions from Scale Feedbackcited by 24
  4. 2019Preference-Based Learning for Exoskeleton Gait Optimizationcited by 23
  5. 2021Fixed-Budget Best-Arm Identification in Structured Banditscited by 22
  6. 2021Content-driven Music Recommendation: Evolution, State of the Art, and Challengescited by 12
  7. 2022On Elimination Strategies for Bandit Fixed-Confidence Identificationcited by 8
  8. 2023From "Thumbs Up" to "10 out of 10": Reconsidering Scalar Feedback in Interactive Reinforcement Learningcited by 6
  9. 2023Optimal Exploration is no harder than Thompson Samplingcited by 3
  10. 2020Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Banditcited by 2
  11. 2024Human Goal Recognition as Bayesian Inference: Investigating the Impact of Actions, Timing, and Goal Solvabilitycited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025ResponseRank: Data-Efficient Reward Modeling through Preference Strength Learning
  2. 2025Preference is More Than Comparisons: Rethinking Dueling Bandits with Augmented Human Feedback
  3. 2026On the Complexity of Preference-Based Bandits
  4. 2023Provable Benefits of Policy Learning from Human Preferences in Contextual Bandit Problems
  5. 2025Active Human Feedback Collection via Neural Contextual Dueling Bandits
  6. 2026Reward Learning from Best-of-N Preference Data: Targets, Tradeoffs, and Design Principles
  7. 2024Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
  8. 2025PILAF: Optimal Human Preference Sampling for Reward Modeling