Simulation-Based Inference for Adaptive Experiments
Not on the map. Why?
Abstract (arXiv)
Multi-arm bandit experimental designs are increasingly being adopted over standard randomized trials due to their potential to improve outcomes for study participants, enable faster identification of the best-performing options, and/or enhance the precision of estimating key parameters. Current approaches for inference after adaptive sampling either rely on asymptotic normality under restricted experiment designs or underpowered martingale concentration inequalities that lead to weak power in practice. To bypass these limitations, we propose a simulation-based approach for conducting hypothesis tests and constructing confidence intervals for arm specific means and their differences. Our simulation-based approach uses positively biased nuisances to generate additional trajectories of the experiment, which we call textitsimulation with optimism. Using these simulations, we characterize the distribution potentially non-normal sample mean test statistic to conduct inference. We provide guarantees for (i) asymptotic type I error control, (ii) convergence of our confidence intervals, and (iii) asymptotic strong consistency of our estimator over a wide variety of common bandit designs. Our empirical results show that our approach achieves the desired coverage while reducing confidence interval widths by up to 50%, with drastic improvements for arms not targeted by the design.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 18 of its 38 references that are in the map. First posted on arXiv 3 Jun 2025.
Builds on
18 of 38 references.
References · 18
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 229
- 2020Estimating means of bounded random variables by bettingcited by 169
- 2022Game-theoretic statistics and safe anytime-valid inferencecited by 155
- 2019Confidence Intervals for Policy Evaluation in Adaptive Experimentscited by 95
- 2021Statistical Inference with M-Estimators on Adaptively Collected Datacited by 40
- 2021Off-Policy Evaluation via Adaptive Weighting with Data from Contextual Banditscited by 40
- 2022Anytime-valid off-policy inference for contextual banditscited by 37
- 2017Why Adaptively Collected Data Have Negative Bias and How to Correct for Itcited by 36
- 2021Post-Contextual-Bandit Inferencecited by 32
- 2021Time-uniform central limit theory and asymptotic confidence sequencescited by 29
- 2019On the bias, risk and consistency of sample means in multi-armed banditscited by 25
- 2021Batched Thompson Samplingcited by 19
6 more
- 2024Inference with the Upper Confidence Bound Algorithmcited by 12
- 2022Near-Optimal Non-Parametric Sequential Tests and Confidence Sequences with Possibly Dependent Observationscited by 9
- 2024Peeking with PEAK: Sequential, Nonparametric Composite Hypothesis Tests for Means of Multiple Data Streamscited by 9
- 2023Adaptive Neyman Allocationcited by 8
- 2023Did we personalize? Assessing personalization by an online reinforcement learning algorithm using resamplingcited by 6
- 2024Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Banditscited by 5
Built on by
Citing papers per year: 2026: 3.
3 papers.