Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learning
Abstract
In this paper we present a new way of predicting the performance of a reinforcement learning policy given historical data that may have been generated by a different policy. The ability to evaluate a policy from historical data is important for applications where the deployment of a bad policy can be dangerous or costly. We show empirically that our algorithm produces estimates that often have orders of magnitude lower mean squared error than existing methods—it makes more efficient use of the available data. Our new estimator is based on two advances: an extension of the doubly robust estimator (Jiang & Li, 2015), and a new way to mix between model based and importance sampling based estimates.
Cite
Text
Thomas and Brunskill. "Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learning." International Conference on Machine Learning, 2016.Markdown
[Thomas and Brunskill. "Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learning." International Conference on Machine Learning, 2016.](https://mlanthology.org/icml/2016/thomas2016icml-dataefficient/)BibTeX
@inproceedings{thomas2016icml-dataefficient,
title = {{Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learning}},
author = {Thomas, Philip and Brunskill, Emma},
booktitle = {International Conference on Machine Learning},
year = {2016},
pages = {2139-2148},
volume = {48},
url = {https://mlanthology.org/icml/2016/thomas2016icml-dataefficient/}
}