Optimal and Adaptive Off-policy Evaluation in Contextual Bandits
원문 초록
We study the off-policy evaluation problem---estimating the value of a target policy using data collected by another policy---under the contextual bandit model. We consider the general (agnostic) setting without access to a consistent model of rewards and establish a minimax lower bound on the mean squared error (MSE). The bound is matched up to constants by the inverse propensity scoring (IPS) and doubly robust (DR) estimators. This highlights the difficulty of the agnostic contextual setting, in contrast with multi-armed bandits and contextual bandits with access to a consistent reward model, where IPS is suboptimal. We then propose the SWITCH estimator, which can use an existing reward model (not necessarily consistent) to achieve a better bias-variance tradeoff than IPS and DR. We prove an upper bound on its MSE and demonstrate its benefits empirically on a diverse collection of data sets, often outperforming prior work by orders of magnitude.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Minimum Empirical Divergence for Sub-Gaussian Linear Bandits
Off-policy estimation with adaptively collected data: the power of online learning
Designing an Interpretable Interface for Contextual Bandits
Doubly-Robust Off-Policy Evaluation with Estimated Logging Policy
Cramming Contextual Bandits for On-policy Statistical Evaluation
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
토론
이 논문과 연결된 포럼 글이 아직 없습니다.