Avoiding Overfitting to the Importance Weights in Offline Policy Optimization

Yao Liu, Emma Brunskill

Keywords: Reinforcement Learning, Batch Reinforcement Learning, Policy Optimization, Overfitting

Abstract: Offline policy optimization has a critical impact on many real-world decision-making problems, as online learning is costly and concerning in many applications. Importance sampling and its variants are a widely used type of estimator in offline policy evaluation, which can be helpful to remove assumptions on the chosen function approximations used to represent value functions and process models. In this paper, we identify an important overfitting phenomenon in optimizing the importance weighted return, and propose an algorithm to avoid this overfitting. We provide a theoretical justification of the proposed algorithm through a better per-state-neighborhood normalization condition and show the limitation of previous attempts to this approach through an illustrative example. We further test our proposed method in a healthcare-inspired simulator and a logged dataset collected from real hospitals. These experiments show the proposed method with less overfitting and better test performance compared with state-of-the-art batch reinforcement learning algorithms.

One-sentence Summary: An unique overfitting in offline policy optimization related to importance weights, and its solution with validation on healthcare simulator