mlsanityData to 7 Oct 2026

Expert-Supervised Reinforcement Learning for Offline Policy Learning and Evaluation

arXiv 2006.13189 ↗First posted 23 Jun 2020cs.LG cs.AI stat.MEcited by 14

On the map: Offline RL and imitation learning from data → Offline RL algorithms

Abstract (arXiv)

Offline Reinforcement Learning (RL) is a promising approach for learning optimal policies in environments where direct exploration is expensive or unfeasible. However, the adoption of such policies in practice is often challenging, as they are hard to interpret within the application context, and lack measures of uncertainty for the learned policy value and its decisions. To overcome these issues, we propose an Expert-Supervised RL (ESRL) framework which uses uncertainty quantification for offline policy learning. In particular, we have three contributions: 1) the method can learn safe and optimal policies through hypothesis testing, 2) ESRL allows for different levels of risk averse implementations tailored to the application context, and finally, 3) we propose a way to interpret ESRL's policy at every state through posterior distributions, and use this framework to compute off-policy value function posteriors. We provide theoretical guarantees for our estimators and regret bounds consistent with Posterior Sampling for RL (PSRL). Sample efficiency of ESRL is independent of the chosen risk aversion threshold and quality of the behavior policy.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 15 of its 32 references that are in the map. First posted on arXiv 23 Jun 2020.

Builds on

15 of 32 references.

Closest ancestors · 4

Same direction, newest first

  1. 2020MOReL : Model-Based Offline Reinforcement Learning12 May
  2. 2020D4RL: Datasets for Deep Data-Driven Reinforcement Learning15 Apr
  3. 2019Behavior Regularized Offline Reinforcement Learning26 Nov
  4. 2019Benchmarking Batch Deep Reinforcement Learning Algorithms3 Oct

Other references · 11

  1. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
  2. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 833
  3. 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
  4. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
  5. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  6. 2018Model-Ensemble Trust-Region Policy Optimizationcited by 214
  7. 2016Why is Posterior Sampling Better than Optimism for Reinforcement Learning?cited by 116
  8. 2017The Uncertainty Bellman Equation and Explorationcited by 81
  9. 2017Continuous State-Space Models for Optimal Sepsis Treatment - a Deep Reinforcement Learning Approachcited by 68
  10. 2018Evaluating Reinforcement Learning Algorithms in Observational Health Settingscited by 60
  11. 2017Informed Bayesian T-Testscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 3; 2024: 1; 2025: 3; 2026: 1.

14 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2025Evaluation-Time Policy Switching for Offline Reinforcement Learning
  2. 2026From Static Policies to Adaptive Priors in Offline Reinforcement Learning
  3. 2024Diffusion Policies for Risk-Averse Behavior Modeling in Offline Reinforcement Learning
  4. 2021NeoRL: A Near Real-World Benchmark for Offline Reinforcement Learning
  5. 2023Selective Uncertainty Propagation in Offline RL
  6. 2024Bayesian Design Principles for Offline-to-Online Reinforcement Learning
  7. 2022Conservative Bayesian Model-Based Value Expansion for Offline Policy Optimization
  8. 2022Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian