paper-with-me

홈 › Papers

Contextual Bandits and Imitation Learning with Preference-Based Active Queries

2023-09-21 · NeurIPS 2023 11

We consider the problem of contextual bandits and imitation learning, where the learner lacks direct knowledge of the executed action's reward. Instead, the learner can actively request the expert at each round to compare two actions and receive noisy preference feedback. The learner's objective is two-fold: to minimize regret associated with the executed actions, while simultaneously, minimizing the number of comparison queries made to the expert. In this paper, we assume that the learner has access to a function class that can represent the expert's preference model under appropriate link functions and present an algorithm that leverages an online regression oracle with respect to this function class. For the contextual bandit setting, our algorithm achieves a regret bound that combines the best of both worlds, scaling as $O(\min\\{\sqrt{T}, d/\Delta\\})$, where $T$ represents the number of interactions, $d$ represents the eluder dimension of the function class, and $\Delta$ represents the minimum preference of the optimal action over any suboptimal action under all contexts. Our algorithm does not require the knowledge of $\Delta$, and the obtained regret bound is comparable to what can be achieved in the standard contextual bandits setting where the learner observes reward signals at each round. Additionally, our algorithm makes only $O(\min\\{T, d^2/\Delta^2\\})$ queries to the expert. We then extend our algorithm to the imitation learning setting, where the agent engages with an unknown environment in episodes of length $H$, and provide similar guarantees regarding regret and query complexity. Interestingly, with preference-based feedback, our imitation learning algorithm can learn a policy outperforming a sub-optimal expert, matching the result from interactive imitation learning algorithms [Ross and Bagnell, 2014] that require access to the expert's actions and also reward signals.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Contextual Bandits and Imitation Learning via Preference-Based Active Queries

2023-07-24 · Ayush Sekhari, Karthik Sridharan, Wen Sun, Runzhe Wu

We consider the problem of contextual bandits and imitation learning, where the learner lacks direct knowledge of the executed action's reward. Instead, the learner can actively query an expert at each round to compare t…

Imitation LearningMulti-Armed Bandits

Provably Efficient Personalized Multi-Objective Bandits with Proactive Conversational Queries

2026-06-07 · Linfeng Cao, Ming Shi, Ness B. Shroff arxiv

Personalized decision-making in multi-objective bandits requires learning user-specific trade-offs among competing objectives. Since arm utility depends on both unknown rewards and unknown preferences, existing methods i…

Active Human Feedback Collection via Neural Contextual Dueling Bandits

2025-04-16 · Arun Verma, Xiaoqiang Lin, Zhongxiang Dai, Daniela Rus 외

Collecting human preference feedback is often expensive, leading recent works to develop principled algorithms to select them more efficiently. However, these works assume that the underlying reward function is linear, a…

Enhancing Preference-based Linear Bandits via Human Response Time

2024-09-09 · Shen Li, Yuyang Zhang, Zhaolin Ren, Claire Liang 외

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 informatio…

Provably Efficient RLHF Pipeline: A Unified View from Contextual Bandits

2025-02-11 · Long-Fei Li, Yu-Yang Qian, Peng Zhao, Zhi-Hua Zhou

Reinforcement Learning from Human Feedback (RLHF) is a widely used approach for aligning Large Language Models (LLMs) with human preferences. While recent advancements have provided valuable insights into various stages …

Computational EfficiencyMulti-Armed Bandits