Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies
<|reference_start|>Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies: We consider off-policy evaluation (OPE) of deterministic target policies for reinforcement learning (RL) in environments with continuous action spaces. While it is common to use importance sampling for OPE, it suffers from high variance when the behavior policy deviates significantly from the target policy. In order to address this issue, some recent works on OPE proposed in-sample learning with importance resampling. Yet, these approaches are not applicable to deterministic target policies for continuous action spaces. To address this limitation, we propose to relax the deterministic target policy using a kernel and learn the kernel metrics that minimize the overall mean squared error of the estimated temporal difference update vector of an action value function, where the action value function is used for policy evaluation. We derive the bias and variance of the estimation error due to this relaxation and provide analytic solutions for the optimal kernel metric. In empirical studies using various test domains, we show that the OPE with in-sample learning using the kernel with optimized metric achieves significantly improved accuracy than other baselines.<|reference_end|>
@article{lee2024kernel,
    title={Kernel Metric Learning for In-Sample Off-Policy Evaluation of
  Deterministic RL Policies},
    author={Haanvid Lee, Tri Wahyu Guntara, Jongmin Lee, Yung-Kyun Noh, Kee-Eung
  Kim},
    journal={arXiv preprint arXiv:2405.18792},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.18792},
    primaryClass={cs.LG cs.AI}
}