cs.LGOct 17, 2023

Informed Posterior Sampling: More Efficient Online Learning with Few Offline Demonstrations in Average-Reward MDPs

Authors: Dengwang Tang, Dongze Ye, Botao Hao, Rahul Jain, Zheng Wen

Organizations: University of Southern California · DeepMind

Abstract

We study efficient online reinforcement learning in the infinite horizon setting when there is an offline dataset to start with. We assume that the offline dataset is generated by an expert but with an unknown level of competence, i.e., it is not perfect and not necessarily using the optimal policy. We show that if the learning agent models the behavioral policy (parameterized by a competence parameter) used by the expert, it can do substantially better in terms of minimizing cumulative regret than if it does not do that. We establish an upper bound on regret of the exact informed PSRL (iPSRL) algorithm that scales as O~(T)\widetilde{\mathcal{O}}(\sqrt{T}). This requires a novel prior-dependent regret analysis of Bayesian online learning algorithms for the infinite horizon setting. We then propose the informed RLSVI (iRLSVI) algorithm to efficiently approximate the iPSRL algorithm. Empirical results show that small offline expert datasets are sufficient for iRLSVI to outperform online-only algorithms on hard exploration domains.

Figures & tables

Appendix figures & tables23 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Information-Directed Offline-to-Online Reinforcement Learning

    May 28, 2026Keru ChenRegret Minimization in RLBayesian RL

  2. Fully Offline Reinforcement Learning

    May 28, 2025Mattie Fellows, Clarisse Wibault, Uljad Berdica +3Bayesian RLOffline RL