Statistical Inference for Adaptively Collected Data

This direction is split into other directions: variance-stabilized weighting, adaptive sampling bias, adaptive data dependency. Its last version stays readable and citable here.

Version 1 of 1237 papers337 conceptsfrozen 2026-10-04

In classical statistics, we are taught that data points are independent and identically distributed (i.i.d.). This assumption is the bedrock of the Central Limit Theorem, allowing us to build confidence intervals and calculate p-values with ease.

However, modern decision-making systems—ranging from clinical trials to recommendation engines—rarely produce i.i.d. data. Instead, they use adaptive data collection. In these systems, the decision of what to sample next depends on the outcomes of previous observations. While this adaptivity is excellent for performance (e.g., giving the best treatment to more patients), it creates a "statistical nightmare" for inference.

The Feedback Loop Problem

The core issue is a feedback loop between the data-collection policy and the noise in the environment. As Licong Lin and Koulik Khamaru point out, when we change our strategy based on what we’ve learned, we introduce endogenous correlations.

Imagine a multi-armed bandit algorithm. If an arm happens to produce a few high rewards due to random noise, the algorithm will sample that arm more frequently. The "noise" from the past now dictates the "covariates" of the future. This dependency breaks the mathematical structures required for traditional debiasing and causes standard estimators, like Ordinary Least Squares (OLS), to produce non-normal distributions. As Kelly W. Zhang and Lucas Janson demonstrate, this often leads to underestimated uncertainty and dangerously high false-positive rates.

Restoring Normality through Reweighting

To fix this, researchers have developed methods to "debias" the adaptive process. Susan Athey and Zhengyuan Zhou introduced a generalized estimator that uses non-uniform reweighting to stabilize variance. By carefully weighting observations, they can achieve "minimax optimal" regret while maintaining the ability to perform valid inference.

Similarly, Yash Deshpande and Mohammad Mehrabi propose an online debiasing framework for high-dimensional data. Their insight is to ensure that debiasing matrices are "predictable" relative to the data stream. This allows the estimator to reach asymptotic normality even when future observations are influenced by past noise, making it possible to generate reliable p-values for time series and clinical trials.

Anytime-Valid Inference

In many real-world scenarios, we don't want to wait for a fixed sample size to conclude an experiment. We want to monitor the data and stop as soon as we have a result. Traditional p-values are invalid if you "peek" at the data, but "anytime-valid" inference solves this.

Alan Mishler and Aaditya Ramdas utilize "betting-style" inference to create confidence sequences that remain valid no matter when you stop the experiment. This is complemented by work from Nicolas Emmenegger and Andreas Krause, who use likelihood ratios to generate tight uncertainty estimates that adapt to the specific geometry of the problem's noise model.

Leveraging the Known Design

Perhaps the most intuitive way to handle adaptive data is to stop worrying about the unknown distribution of the rewards and focus on the known randomness of the algorithm itself. This is called "design-based inference."

Dae-Woong Ham and Iavor Bojinov argue that because we know exactly how the bandit algorithm chooses its actions, we can use that information to calculate valid confidence intervals, even if the rewards are non-stationary or non-independent.

This leads to the Adaptive Randomization Test (ART), proposed by Ham and Qiu, and the weighted randomization test by Lucas Janson and Yash Nair. These tests provide exact p-values by leveraging the "propensity scores" (the probability of choosing a treatment) generated by the adaptive algorithm, effectively turning the "statistical nightmare" of adaptivity into a source of rigorous evidence.

The Stability of Learning Algorithms

While adaptivity generally complicates things, some algorithms are better behaved than others. Koulik Khamaru and Cun-Hui Zhang recently proved that standard Upper Confidence Bound (UCB) algorithms possess a "stability" property. Under certain conditions, this stability allows researchers to perform inference on UCB-collected data as if it were collected through simple random sampling, providing a theoretical bridge between the world of online learning and classical frequentist statistics.

Papers in this version

Showing 60 of 237 papers.

History & citationVersion 1 · 2026-10-04

Split into other directions · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_statistical_inference_for_adaptively_col_c470801a,
  title = {Statistical Inference for Adaptively Collected Data},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/statistical-inference-for-adaptively-collected-data/rdr_c470801add5b4c22be4de1fa16f16489},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_statistical_inference_for_adaptively_col_c470801a_v1,
  title = {Statistical Inference for Adaptively Collected Data},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/statistical-inference-for-adaptively-collected-data/rdr_c470801add5b4c22be4de1fa16f16489/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}