A Theoretical Framework for Partially-Observed Reward States in RLHF
Chinmaya Kausik, Mirco Mutti, Aldo Pacchiano, Ambuj Tewari
摘要
The growing deployment of reinforcement learning from human feedback (RLHF) calls for a deeper theoretical investigation of its underlying models. The prevalent models of RLHF do not account for neuroscience-backed, partially-observed "internal states" that can affect human feedback, nor do they accommodate intermediate feedback during an interaction. Both of these can be instrumental in speeding up learning and improving alignment. To address these limitations, we model RLHF as reinforcement learning with partially observed reward-states (PORRL). We accommodate two kinds of feedback -cardinal and dueling feedback. We first demonstrate that PORRL subsumes a wide class of RL problems, including traditional RL, RLHF, and reward machines. For cardinal feedback, we present two model-based methods (POR-UCRL, POR-UCBVI). We give both cardinal regret and sample complexity guarantees for the methods, showing that they improve over naive history-summarization. We then discuss the benefits of a model-free method like GOLF with naive history-summarization in settings with recursive internal states and dense intermediate feedback. For this purpose, we define a new history aware version of the Bellman-eluder dimension and give a new guarantee for GOLF in our setting, which can be exponentially sharper in illustrative examples. For dueling feedback, we show that a naive reduction to cardinal feedback fails to achieve sublinear dueling regret. We then present the first explicit reduction that converts guarantees for cardinal regret to dueling regret. In both feedback settings, we show that our models and guarantees generalize and extend existing ones. 2 We will further denote τ rhs " ps1, a1, . . . , s h , a h q the sub-trajectory of τ of length h and Γ h the corresponding space of sub-trajectories of length h. 3 Recall that choosing a formal state s1 to serve as a placeholder initial state is not restrictive. 4 This subsumes and generalizes the example of Bernoulli feedback in RLHF.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper18
- Training language models to follow instructions with human feedbackLong Ouyang, Jeffrey Wu, Xu Jiang, Diogo Almeida 等NeurIPS 2022 · 被引用 24,707 次
- Fine-Grained Human Feedback Gives Better Rewards for Language Model TrainingZeqiu Wu, Yushi Hu, Weijia Shi, Nouha Dziri 等NeurIPS 2023 · 被引用 516 次
- PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-trainingKimin Lee, Laura M. Smith, Pieter AbbeelICML 2021 · 被引用 380 次
- Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient AlgorithmsChi Jin, Qinghua Liu, Sobhan MiryoosefiNeurIPS 2021 · 被引用 264 次
- A Minimaximalist Approach to Reinforcement Learning from Human FeedbackGokul Swamy, Christoph Dann, Rahul Kidambi, Steven Wu 等ICML 2024 · 被引用 147 次
相关 Paper
- Efficient and Near-Optimal Algorithm for Contextual Dueling Bandits with Offline Regression OraclesAadirupa Saha, Robert E. SchapireNeurIPS 2025 · 被引用 3 次
- Exploration-Driven Policy Optimization in RLHF: Theoretical Insights on Efficient Data UtilizationYihan Du, Anna Winnicki, Gal Dalal, Shie Mannor 等ICML 2024 · 被引用 22 次
- Is RLHF More Difficult than Standard RL? A Theoretical PerspectiveYuanhao Wang, Qinghua Liu, Chi JinNeurIPS 2023
- Contrastive Preference Learning: Learning from Human Feedback without Reinforcement LearningJoey Hejna, Rafael Rafailov, Harshit Sikchi, Chelsea Finn 等ICLR 2024 · 被引用 37 次
- Near-Optimal Regret in Linear MDPs with Aggregate Bandit FeedbackAsaf B. Cassel, Haipeng Luo, Aviv Rosenberg, Dmitry SotnikovICML 2024 · 被引用 6 次
