Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Safe Policy Improvement with Baseline Bootstrapping

About

This paper considers Safe Policy Improvement (SPI) in Batch Reinforcement Learning (Batch RL): from a fixed dataset and without direct access to the true environment, train a policy that is guaranteed to perform at least as well as the baseline policy used to collect the data. Our approach, called SPI with Baseline Bootstrapping (SPIBB), is inspired by the knows-what-it-knows paradigm: it bootstraps the trained policy with the baseline when the uncertainty is high. Our first algorithm, $\Pi_b$-SPIBB, comes with SPI theoretical guarantees. We also implement a variant, $\Pi_{\leq b}$-SPIBB, that is even more efficient in practice. We apply our algorithms to a motivational stochastic gridworld domain and further demonstrate on randomly generated MDPs the superiority of SPIBB with respect to existing algorithms, not only in safety but also in mean performance. Finally, we implement a model-free version of SPIBB and show its benefits on a navigation task with deep RL implementation called SPIBB-DQN, which is, to the best of our knowledge, the first RL algorithm relying on a neural network representation able to train efficiently and reliably from batch data, without any interaction with the environment.

Romain Laroche, Paul Trichelair, R\'emi Tachet des Combes• 2017

Related benchmarks

TaskDatasetResultRank
Policy SelectionFrozen Lake Random 1
Max Score0.32
8
Policy SelectionRandom Frozen Lake Environment 4
Max Performance Score0.32
8
Off-policy policy selectionChain environment 100 batches (Evaluation)
Max ∆U0.55
8
Policy SelectionRandom Frozen Lake Environment 2
Maximum Score0.33
8
Policy SelectionRandom Frozen Lake Environment 3
Max Score0.3
8
Off-policy policy selectionRing environment 100 batches (Evaluation)
Max Utility Difference0.61
8
Showing 6 of 6 rows

Other info

Follow for update