Off-Policy Interval Estimation with Lipschitz Value Iteration
Ziyang Tang, Yihao Feng, Na Zhang, Jian Peng, Qiang Liu
Abstract
Off-policy evaluation provides an essential tool for evaluating the effects of different policies or treatments using only observed data. When applied to high-stakes scenarios such as medical diagnosis or financial decision-making, it is essential to provide provably correct upper and lower bounds of the expected reward, not just a classical single point estimate, to the end-users, as executing a poor policy can be very costly. In this work, we propose a provably correct method for obtaining interval bounds for off-policy evaluation in a general continuous setting. The idea is to search for the maximum and minimum values of the expected reward among all the Lipschitz Q-functions that are consistent with the observations, which amounts to solving a constrained optimization problem on a Lipschitz function space. We go on to introduce a Lipschitz value iteration method to monotonically tighten the interval, which is simple yet efficient and provably convergent. We demonstrate the practical efficiency of our method on a range of benchmarks.
BibTeX
@inproceedings{NEURIPS2020_59accb9f,
author = {Tang, Ziyang and Feng, Yihao and Zhang, Na and Peng, Jian and Liu, Qiang},
booktitle = {Advances in Neural Information Processing Systems},
editor = {H. Larochelle and M. Ranzato and R. Hadsell and M.F. Balcan and H. Lin},
pages = {7887--7897},
publisher = {Curran Associates, Inc.},
title = {Off-Policy Interval Estimation with Lipschitz Value Iteration},
url = {https://proceedings.neurips.cc/paper_files/paper/2020/file/59accb9fe696ce55e28b7d23a009e2d1-Paper.pdf},
volume = {33},
year = {2020}
}