Randomization Tests for Adaptively Collected Data

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.

Authors

Institutions

Publication Details

Journal
Journal of the American Statistical Association
Published
2026-07-27
DOI
https://doi.org/10.1080/01621459.2026.2705554
Citations
2
Primary Topic
Machine Learning and Algorithms
Type
article
Field-Weighted Citation Impact
9.38

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Randomization Tests for Adaptively Collected Data

Yash Nair, Lucas Janson
2 citations
Journal of the American Statistical Association
Machine Learning and Algorithms
9.38
article

Randomization Tests for Adaptively Collected Data

Yash Nair, Lucas Janson
article en
2 citations

Abstract

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.

Journal of the American Statistical Association
Stanford University (US)
National Science Foundation, Division of Chemical, Bioengineering, Environmental, and Transport Systems
Openalex Percentile: Top 6%
Machine Learning and Algorithms
9.38
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Randomization Tests for Adaptively Collected Data — Yash Nair, Lucas Janson · Journal of the American Statistical Association (2026) | TGRS Research Map | TGRS