.png){kind=icon}
Return
Randomization Tests for Adaptively Collected Data
.png){kind=icon}
PRE
AI
DOI：10.1080/01621459.2026.2705554.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Randomization testing is a fundamental method in statistics, enabling inferential tasks such as testing for (conditional) independence of random variables, constructing confidence intervals in semiparametric location models, and constructing (by inverting a permutation test) model-free prediction intervals via conformal prediction. Randomization tests are exactly valid for any sample size, but their use is generally confined to exchangeable data. Yet in many applications, data is routinely collected adaptively via, e.g., (contextual) bandit and reinforcement learning algorithms or adaptive experimental designs. In this paper we present a general framework for randomization testing on adaptively collected data (despite its non-exchangeability) that uses a weighted randomization test, for which we also present novel computationally tractable resampling algorithms for various popular adaptive assignment algorithms, data-generating environments, and types of inferential tasks. Finally, we demonstrate via a range of simulations the efficacy of our framework for both testing and confidence/prediction interval construction.
Keywords:
Conformal prediction
Conditional independence testing
Contextual bandits
Reinforcement learning
Sequential experimentation
Journal
J
IF:
3
Papers:
5.2K
Citations:
4.8W
Organization
Cited Papers
No cited papers available