Bayesian Counterfactual Risk Minimization
International Conference on Machine Learning (ICML), 2018
- OffRL
Abstract
We present a Bayesian view of counterfactual risk minimization (CRM), also known as offline policy optimization from logged bandit feedback. Using PAC-Bayesian analysis, we derive a new generalization bound for the truncated IPS estimator. We apply the bound to a class of Bayesian policies, which motivates a novel, potentially data-dependent, regularization technique for CRM.
View on arXivComments on this paper
