mlsanityData to 7 Oct 2026

Confidence Intervals for Policy Evaluation in Adaptive Experiments

arXiv 1911.02768 ↗First posted 7 Nov 2019stat.ML cs.LG stat.MEcited by 95

Not on the map. Why?

Abstract (arXiv)

Adaptive experiment designs can dramatically improve statistical efficiency in randomized trials, but they also complicate statistical inference. For example, it is now well known that the sample mean is biased in adaptive trials. Inferential challenges are exacerbated when our parameter of interest differs from the parameter the trial was designed to target, such as when we are interested in estimating the value of a sub-optimal treatment after running a trial to determine the optimal treatment using a stochastic bandit design. In this context, typical estimators that use inverse propensity weighting to eliminate sampling bias can be problematic: their distributions become skewed and heavy-tailed as the propensity scores decay to zero. In this paper, we present a class of estimators that overcome these issues. Our approach is to adaptively reweight the terms of an augmented inverse propensity weighting estimator to control the contribution of each term to the estimator's variance. This adaptive weighting scheme prevents estimates from becoming heavy-tailed, ensuring asymptotically correct coverage. It also reduces variance, allowing us to test hypotheses with greater power - especially hypotheses that were not targeted by the experimental design. We validate the accuracy of the resulting estimates and their confidence intervals in numerical experiments and show our methods compare favorably to existing alternatives in terms of RMSE and coverage.

Key facts. Cited by 95 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Nov 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 17; 2022: 11; 2023: 19; 2024: 18; 2025: 16; 2026: 14.

95 papers.

Sort:

By area:

  1. 2024Active Statistical Inferencecited by 46
  2. 2021Statistical Inference with M-Estimators on Adaptively Collected Datacited by 40
  3. 2021Off-Policy Evaluation via Adaptive Weighting with Data from Contextual Banditscited by 40
  4. 2022Anytime-valid off-policy inference for contextual banditscited by 37
  5. 2021Deeply-Debiased Off-Policy Interval Estimationcited by 36
  6. 2021Post-Contextual-Bandit Inferencecited by 32
  7. 2022Policy learning "without" overlap: Pessimism and generalized empirical Bernstein's inequalitycited by 32
  8. 2021A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithmscited by 29
  9. 2023Semiparametric Efficient Inference in Adaptive Experimentscited by 23
  10. 2022Designing Reinforcement Learning Algorithms for Digital Interventions: Pre-implementation Guidelinescited by 22
  11. 2021Online Multi-Armed Bandits with Adaptive Inferencecited by 21
  12. 2021Policy Learning with Adaptively Collected Datacited by 21
38 more
  1. 2021Near-optimal inference in adaptive linear regressioncited by 20
  2. 2024UCB algorithms for multi-armed bandits: Precise regret and adaptive inferencecited by 16
  3. 2021Weak Signal Asymptotics for Sequentially Randomized Experimentscited by 13
  4. 2022Counterfactual inference in sequential experimentscited by 13
  5. 2024Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate Choicescited by 12
  6. 2021Learning to be Fair: A Consequentialist Approach to Equitable Decision-Makingcited by 11
  7. 2021Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learningcited by 10
  8. 2024Inference with the Upper Confidence Bound Algorithmcited by 9
  9. 2024Online Experimental Design With Estimation-Regret Trade-off Under Network Interferencecited by 9
  10. 2022Synthetically Controlled Banditscited by 8
  11. 2022Multi-disciplinary fairness considerations in machine learning for clinical trialscited by 8
  12. 2023An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed Banditscited by 8
  13. 2021Efficient Inference Without Trading-off Regret in Bandits: An Allocation Probability Test for Thompson Samplingcited by 7
  14. 2022Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descentcited by 7
  15. 2023Proportional Response: Contextual Bandits for Simple and Cumulative Regret Minimizationcited by 7
  16. 2024Linear Contextual Bandits with Interferencecited by 7
  17. 2021Challenges in Statistical Analysis of Data Collected by a Bandit Algorithm: An Empirical Exploration in Applications to Adaptively Randomized Experimentscited by 6
  18. 2022Reinforcement Learning in Modern Biostatistics: Constructing Optimal Adaptive Interventionscited by 6
  19. 2022Contextual Bandits in a Survey Experiment on Charitable Giving: Within-Experiment Outcomes versus Policy Learningcited by 6
  20. 2023Semi-parametric inference based on adaptively collected datacited by 6
  21. 2023Did we personalize? Assessing personalization by an online reinforcement learning algorithm using resamplingcited by 6
  22. 2023Adaptive Linear Estimating Equationscited by 6
  23. 2025Stable Thompson Sampling: Valid Inference via Variance Inflationcited by 6
  24. 2024Prediction-Guided Active Experimentscited by 5
  25. 2026Reinforcement Learning in the Real World: A Survey of Statistical Challenges and Future Directionscited by 5
  26. 2021Doubly Robust Interval Estimation for Optimal Policy Evaluation in Online Learningcited by 4
  27. 2022Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gapcited by 4
  28. 2023Adaptive Principal Component Regression with Applications to Panel Datacited by 4
  29. 2024Best of Three Worlds: Adaptive Experimentation for Digital Marketing in Practicecited by 4
  30. 2024Allocation Stability and Wald Inference under Variance-Aware UCBcited by 4
  31. 2025Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?cited by 4
  32. 2021Debiasing Samples from Online Learning Using Bootstrapcited by 3
  33. 2022Best Arm Identification with Contextual Information under a Small Gapcited by 3
  34. 2023Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Boundscited by 3
  35. 2023Statistical Limits of Adaptive Linear Models: Low-Dimensional Estimation and Inferencecited by 3
  36. 2023Worst-Case Optimal Multi-Armed Gaussian Best Arm Identification with a Fixed Budgetcited by 3
  37. 2023Locally Optimal Fixed-Budget Best Arm Identification in Two-Armed Gaussian Bandits with Unknown Variancescited by 3
  38. 2024Monitoring Fidelity of Online Reinforcement Learning Algorithms in Clinical Trialscited by 3

50 most cited of 95 All 95 (JSON)