On the Theory of Reinforcement Learning with Once-per-Episode Feedback
Niladri S. Chatterji, Aldo Pacchiano, Peter L. Bartlett, Michael I. Jordan
摘要
We study a theory of reinforcement learning (RL) in which the learner receives binary feedback only once at the end of an episode. While this is an extreme test case for theory, it is also arguably more representative of real-world applications than the traditional requirement in RL practice that the learner receive feedback at every time step. Indeed, in many real-world applications of reinforcement learning, such as self-driving cars and robotics, it is easier to evaluate whether a learner’s complete trajectory was either “good” or “bad,” but harder to provide a reward signal at each step. To show that learning is possible in this more challenging setting, we study the case where trajectory labels are generated by an unknown parametric model, and provide a statistically and computationally efficient algorithm that achieves sub-linear regret.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper24
- Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise ComparisonsBanghua Zhu, Michael I. Jordan, Jiantao JiaoICML 2023 · 被引用 273 次
- Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function ApproximationXiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang 等ICML 2022 · 被引用 90 次
- Iterative Data Smoothing: Mitigating Reward Overfitting and Overoptimization in RLHFBanghua Zhu, Michael I. Jordan, Jiantao JiaoICML 2024 · 被引用 53 次
- 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 次
它引用的顶会 Paper6
- Reward-Free Exploration for Reinforcement LearningChi Jin, Akshay Krishnamurthy, Max Simchowitz, Tiancheng YuICML 2020 · 被引用 226 次
- Improved Optimistic Algorithms for Logistic BanditsLouis Faury, Marc Abeille, Clément Calauzènes, Olivier FercoqICML 2020 · 被引用 127 次
- Preference-based Reinforcement Learning with Finite-Time GuaranteesYichong Xu, Ruosong Wang, Lin F. Yang, Aarti Singh 等NeurIPS 2020 · 被引用 82 次
- Provably Efficient Reward-Agnostic Navigation with Linear Value IterationAndrea Zanette, Alessandro Lazaric, Mykel J. Kochenderfer, Emma BrunskillNeurIPS 2020 · 被引用 68 次
- Reinforcement Learning with Trajectory FeedbackYonathan Efroni, Nadav Merlis, Shie MannorAAAI 2021 · 被引用 48 次
相关 Paper
- Reinforcement Learning with Segment FeedbackYihan Du, Anna Winnicki, Gal Dalal, Shie Mannor 等ICML 2025
- Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory FeedbackZihan Zhang, Yuxin Chen, Jason D. Lee, Simon Shaolei Du 等ICML 2025
- NeoRL: Efficient Exploration for Nonepisodic RLBhavya Sukhija, Lenart Treven, Florian Dörfler, Stelian Coros 等NeurIPS 2024 · 被引用 7 次
- Learning Adversarial Linear Mixture Markov Decision Processes with Bandit Feedback and Unknown TransitionCanzhe Zhao, Ruofeng Yang, Baoxiang Wang, Shuai LiICLR 2023
- Near-Optimal Regret in Linear MDPs with Aggregate Bandit FeedbackAsaf B. Cassel, Haipeng Luo, Aviv Rosenberg, Dmitry SotnikovICML 2024 · 被引用 6 次
