On the Theory of Reinforcement Learning with Once-per-Episode Feedback
Niladri S. Chatterji, Aldo Pacchiano, Peter L. Bartlett, Michael I. Jordan
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f75e894e-20bf-407c-8e46-8ccafde77e15Cited by top-tier papers24
- Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise ComparisonsBanghua Zhu, Michael I. Jordan, Jiantao JiaoICML 2023 · 273 citations
- Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function ApproximationXiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang et al.ICML 2022 · 90 citations
- Iterative Data Smoothing: Mitigating Reward Overfitting and Overoptimization in RLHFBanghua Zhu, Michael I. Jordan, Jiantao JiaoICML 2024 · 53 citations
- Learning Long-Term Reward Redistribution via Randomized Return DecompositionZhizhou Ren, Ruihan Guo, Yuan Zhou, Jian PengICLR 2022 · 45 citations
- Making RL with Preference-based Feedback Efficient via RandomizationRunzhe Wu, Wen SunICLR 2024 · 44 citations
Builds on6
- Reward-Free Exploration for Reinforcement LearningChi Jin, Akshay Krishnamurthy, Max Simchowitz, Tiancheng YuICML 2020 · 226 citations
- Improved Optimistic Algorithms for Logistic BanditsLouis Faury, Marc Abeille, Clément Calauzènes, Olivier FercoqICML 2020 · 127 citations
- Preference-based Reinforcement Learning with Finite-Time GuaranteesYichong Xu, Ruosong Wang, Lin F. Yang, Aarti Singh et al.NeurIPS 2020 · 82 citations
- Provably Efficient Reward-Agnostic Navigation with Linear Value IterationAndrea Zanette, Alessandro Lazaric, Mykel J. Kochenderfer, Emma BrunskillNeurIPS 2020 · 68 citations
- Reinforcement Learning with Trajectory FeedbackYonathan Efroni, Nadav Merlis, Shie MannorAAAI 2021 · 48 citations
Related papers
- Reinforcement Learning with Segment FeedbackYihan Du, Anna Winnicki, Gal Dalal, Shie Mannor et al.ICML 2025
- Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory FeedbackZihan Zhang, Yuxin Chen, Jason D. Lee, Simon Shaolei Du et al.ICML 2025
- NeoRL: Efficient Exploration for Nonepisodic RLBhavya Sukhija, Lenart Treven, Florian Dörfler, Stelian Coros et al.NeurIPS 2024 · 7 citations
- 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 citations
