Off-Policy Evaluation via Adaptive Weighting with Data from Contextual Bandits
Ruohan Zhan, Vitor Hadad, David A. Hirshberg, Susan Athey
Abstract
It has become increasingly common for data to be collected adaptively, for example using contextual bandits. Historical data of this type can be used to evaluate other treatment assignment policies to guide future innovation or experiments. However, policy evaluation is challenging if the target policy differs from the one used to collect data, and popular estimators, including doubly robust (DR) estimators, can be plagued by bias, excessive variance, or both. In particular, when the pattern of treatment assignment in the collected data looks little like the pattern generated by the policy to be evaluated, the importance weights used in DR estimators explode, leading to excessive variance. In this paper, we improve the DR estimator by adaptively weighting observations to control its variance. We show that a t-statistic based on our improved estimator is asymptotically normal under certain conditions, allowing us to form confidence intervals and test hypotheses. Using synthetic data and public benchmarks, we provide empirical evidence for our estimator's improved accuracy and inferential properties relative to existing alternatives.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0c328bf8-66d5-4256-97cf-3a2cfa693d03Cited by top-tier papers17
- Statistical Inference with M-Estimators on Adaptively Collected DataKelly W. Zhang, Lucas Janson, Susan A. MurphyNeurIPS 2021 · 66 citations
- Double/Debiased Machine Learning for Dynamic Treatment EffectsGreg Lewis, Vasilis SyrgkanisNeurIPS 2021 · 50 citations
- Offline Neural Contextual Bandits: Pessimism, Optimization and GeneralizationThanh Nguyen-Tang, Sunil Gupta, A. Tuan Nguyen, Svetha VenkateshICLR 2022 · 35 citations
- On Instance-Dependent Bounds for Offline Reinforcement Learning with Linear Function ApproximationThanh Nguyen-Tang, Ming Yin, Sunil Gupta, Svetha Venkatesh et al.AAAI 2023 · 24 citations
- The Adaptive Doubly Robust Estimator and a Paradox Concerning Logging PolicyMasahiro Kato, Kenichiro McAlinn, Shota YasuiNeurIPS 2021 · 23 citations
Builds on3
- Doubly robust off-policy evaluation with shrinkageYi Su, Maria Dimakopoulou, Akshay Krishnamurthy, Miroslav DudíkICML 2020 · 128 citations
- Optimal Off-Policy Evaluation from Multiple Logging PoliciesNathan Kallus, Yuta Saito, Masatoshi UeharaICML 2021 · 44 citations
- On Conditional Versus Marginal Bias in Multi-Armed BanditsJaehyeok Shin, Aaditya Ramdas, Alessandro RinaldoICML 2020 · 13 citations
Related papers
- Post-Contextual-Bandit InferenceAurélien Bibaut, Maria Dimakopoulou, Nathan Kallus, Antoine Chambaz et al.NeurIPS 2021 · 58 citations
- Marginal Density Ratio for Off-Policy Evaluation in Contextual BanditsMuhammad Faaiz Taufiq, Arnaud Doucet, Rob Cornish, Jean-Francois TonNeurIPS 2023 · 14 citations
- Statistical Inference on Multi-armed Bandits with Delayed FeedbackLei Shi, Jingshen Wang, Tianhao WuICML 2023 · 7 citations
- Online Multi-Armed Bandits with Adaptive InferenceMaria Dimakopoulou, Zhimei Ren, Zhengyuan ZhouNeurIPS 2021 · 47 citations
- Distributionally Robust Policy Evaluation and Learning for Continuous Treatment with Observational DataCheuk Hang Leung, Yiyan Huang, Yijun Li, Qi WuAAAI 2025 · 1 citation
