Reinforcement Learning with Trajectory Feedback
Yonathan Efroni, Nadav Merlis, Shie Mannor
摘要
The standard feedback model of reinforcement learning requires revealing the reward of every visited state-action pair. However, in practice, it is often the case that such frequent feedback is not available. In this work, we take a first step towards relaxing this assumption and require a weaker form of feedback, which we refer to as trajectory feedback. Instead of observing the reward obtained after every action, we assume we only receive a score that represents the quality of the whole trajectory observed by the agent, namely, the sum of all rewards obtained over this trajectory. We extend reinforcement learning algorithms to this setting, based on least-squares estimation of the unknown reward, for both the known and unknown transition model cases, and study the performance of these algorithms by analyzing their regret. For cases where the transition model is unknown, we offer a hybrid optimistic-Thompson Sampling approach that results in a tractable algorithm.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper23
- Nash Learning from Human FeedbackRémi Munos, Michal Valko, Daniele Calandriello, Mohammad Gheshlaghi Azar 等ICML 2024 · 被引用 212 次
- Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function ApproximationXiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang 等ICML 2022 · 被引用 90 次
- Learning Long-Term Reward Redistribution via Randomized Return DecompositionZhizhou Ren, Ruihan Guo, Yuan Zhou, Jian PengICLR 2022 · 被引用 45 次
- Making RL with Preference-based Feedback Efficient via RandomizationRunzhe Wu, Wen SunICLR 2024 · 被引用 44 次
- On the Theory of Reinforcement Learning with Once-per-Episode FeedbackNiladri S. Chatterji, Aldo Pacchiano, Peter L. Bartlett, Michael I. JordanNeurIPS 2021 · 被引用 37 次
相关 Paper
- Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory FeedbackZihan Zhang, Yuxin Chen, Jason D. Lee, Simon Shaolei Du 等ICML 2025
- Reinforcement Learning with Segment FeedbackYihan Du, Anna Winnicki, Gal Dalal, Shie Mannor 等ICML 2025
- Reinforcement Learning with Lookahead InformationNadav MerlisNeurIPS 2024 · 被引用 11 次
- Near-Optimal Regret in Linear MDPs with Aggregate Bandit FeedbackAsaf B. Cassel, Haipeng Luo, Aviv Rosenberg, Dmitry SotnikovICML 2024 · 被引用 6 次
- Exploration-Driven Policy Optimization in RLHF: Theoretical Insights on Efficient Data UtilizationYihan Du, Anna Winnicki, Gal Dalal, Shie Mannor 等ICML 2024 · 被引用 22 次
