Bridging the Gap Between Offline and Online Reinforcement Learning Evaluation Methodologies
Preprint
Abstract
Reinforcement learning (RL) has shown great promise with algorithms learning in environments with large state and action spaces purely from scalar reward signals. A crucial challenge for current deep RL algorithms is that they require a tremendous amount of environment interactions for learning. This can be infeasible in situations where such interactions are expensive; such as in robotics. Offline RL algorithms try to address this issue by bootstrapping the learning process from existing logged data without needing to interact with the environment from the very beginning. While online RL algorithms are typically evaluated as a function of the number of environment interactions, there exists no single established protocol for evaluating offline RL methods.In this paper, we propose a sequential approach to evaluate offline RL algorithms as a function of the training set size and thus by their data efficiency. Sequential evaluation provides valuable insights into the data efficiency of the learning process and the robustness of algorithms to distribution changes in the dataset while also harmonizing the visualization of the offline and online learning phases. Our approach is generally applicable and easy to implement. We compare several existing offline RL algorithms using this approach and present insights from a variety of tasks and offline datasets.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Reliable Off-Policy Evaluation for Reinforcement LearningOperations Research, 2024
- Mastering Atari, Go, chess and shogi by planning with a learned modelNature, 2020
- Grandmaster level in StarCraft II using multi-agent reinforcement learningNature, 2019
- Model Cards for Model Reporting2019
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-playScience, 2018
- Mastering the game of Go with deep neural networks and tree searchNature, 2016
- High-Confidence Off-Policy EvaluationProceedings of the AAAI Conference on Artificial Intelligence, 2015
- A Philosophical Treatise of Universal InductionEntropy, 2011
- Asymptotics of Discrete MDL for Online PredictionIEEE Transactions on Information Theory, 2005