LGAIDec 16, 2022

Safe Evaluation For Offline Learning: Are We Ready To Deploy?

arXiv:2212.08302v1h-index: 94
Originality Incremental advance
AI Analysis

This addresses safety concerns in critical domains where deploying poorly-performing policies could be dangerous, though it appears incremental as it builds on existing off-policy evaluation methods.

The paper tackles the problem of safely evaluating reinforcement learning policies learned from offline data before deployment, introducing a framework that uses high-confidence off-policy evaluation to estimate a lower-bound on policy performance to avoid overestimation.

The world currently offers an abundance of data in multiple domains, from which we can learn reinforcement learning (RL) policies without further interaction with the environment. RL agents learning offline from such data is possible but deploying them while learning might be dangerous in domains where safety is critical. Therefore, it is essential to find a way to estimate how a newly-learned agent will perform if deployed in the target environment before actually deploying it and without the risk of overestimating its true performance. To achieve this, we introduce a framework for safe evaluation of offline learning using approximate high-confidence off-policy evaluation (HCOPE) to estimate the performance of offline policies during learning. In our setting, we assume a source of data, which we split into a train-set, to learn an offline policy, and a test-set, to estimate a lower-bound on the offline policy using off-policy evaluation with bootstrapping. A lower-bound estimate tells us how good a newly-learned target policy would perform before it is deployed in the real environment, and therefore allows us to decide when to deploy our learned policy.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes