Doubly Robust Interval Estimation for Optimal Policy Evaluation in Online Learning
arXiv:2110.15501
Abstract
Evaluating the performance of an ongoing policy plays a vital role in many areas such as medicine and economics, to provide crucial instructions on the early-stop of the online experiment and timely feedback from the environment. Policy evaluation in online learning thus attracts increasing attention by inferring the mean outcome of the optimal policy (i.e., the value) in real-time. Yet, such a problem is particularly challenging due to the dependent data generated in the online environment, the unknown optimal policy, and the complex exploration and exploitation trade-off in the adaptive experiment. In this paper, we aim to overcome these difficulties in policy evaluation for online learning. We explicitly derive the probability of exploration that quantifies the probability of exploring non-optimal actions under commonly used bandit algorithms. We use this probability to conduct valid inference on the online conditional mean estimator under each action and develop the doubly robust interval estimation (DREAM) method to infer the value under the estimated optimal policy in online learning. The proposed value estimator provides double protection for consistency and is asymptotically normal with a Wald-type confidence interval provided. Extensive simulation studies and real data applications are conducted to demonstrate the empirical validity of the proposed DREAM method.
References in corpus (13)
- A Contextual-Bandit Approach to Personalized News Article Recommendation
- Thompson Sampling for Contextual Bandits with Linear Payoffs
- Doubly Robust Policy Evaluation and Learning
- Statistical inference for the mean outcome under a possibly non-unique optimal treatment strategy
- A Survey on Contextual Multi-armed Bandits
- Policy Evaluation and Optimization with Continuous Treatments
- Statistical Inference for Online Decision-Making: In a Contextual Bandit Setting
- Are sample means in multi-armed bandits positively or negatively biased?
- OpenML Benchmarking Suites
- Why Adaptively Collected Data Have Negative Bias and How to Correct for It
- Inference for Batched Bandits
- On the bias, risk and consistency of sample means in multi-armed bandits
- Bandit Algorithms for Precision Medicine