Posterior Sampling for Continuing Environments
Not on the map. Why?
Abstract (arXiv)
We develop an extension of posterior sampling for reinforcement learning (PSRL) that is suited for a continuing agent-environment interface and integrates naturally into agent designs that scale to complex environments. The approach, continuing PSRL, maintains a statistically plausible model of the environment and follows a policy that maximizes expected γ-discounted return in that model. At each time, with probability 1-γ, the model is replaced by a sample from the posterior distribution over environments. For a choice of discount factor that suitably depends on the horizon T, we establish an tildeO(τ S √A T) bound on the Bayesian regret, where S is the number of environment states, A is the number of actions, and τ denotes the reward averaging time, which is a bound on the duration required to accurately estimate the average reward of any policy. Our work is the first to formalize and rigorously analyze the resampling approach with randomized exploration.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 13 of its 23 references that are in the map. First posted on arXiv 29 Nov 2022.
Builds on
13 of 23 references.
References · 13
- 2016Deep Exploration via Bootstrapped DQNcited by 527
- 2017A Tutorial on Thompson Samplingcited by 433
- 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
- 2014Generalization and Exploration via Randomized Value Functionscited by 112
- 2020Sample Efficient Reinforcement Learning with REINFORCEcited by 86
- 2019Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processescited by 82
- 2017Learning Unknown Markov Decision Processes: A Thompson Sampling Approachcited by 65
- 2021Reinforcement Learning, Bit by Bitcited by 59
- 2019Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDPcited by 55
- 2021Simple Agent, Complex Environment: Efficient Reinforcement Learning with Agent Statescited by 43
- 2020Hypermodels for Explorationcited by 37
- 2015How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategiescited by 27
1 more
Built on by
Citing papers per year: 2024: 1; 2025: 3.
4 papers.
- 2025Toward Efficient Exploration by Large Language Model Agentscited by 17
- 2025The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspectivecited by 6
- 2024Learning a Fast Mixing Exogenous Block MDP using a Single Trajectorycited by 3
- 2025Concurrent Learning with Aggregated States via Randomized Least Squares Value Iterationcited by 0
- 2025Toward Efficient Exploration by Large Language Model Agents29 Apr 2025
- 2025The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective27 Jan 2025
- 2025Concurrent Learning with Aggregated States via Randomized Least Squares Value Iteration23 Jan 2025
- 2024Learning a Fast Mixing Exogenous Block MDP using a Single Trajectory3 Oct 2024