mlsanityData to 7 Oct 2026

Counterfactual inference in sequential experiments

arXiv 2202.06891 ↗First posted 14 Feb 2022stat.ML cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

We consider after-study statistical inference for sequentially designed experiments wherein multiple units are assigned treatments for multiple time points using treatment policies that adapt over time. Our goal is to provide inference guarantees for the counterfactual mean at the smallest possible scale -- mean outcome under different treatments for each unit and each time -- with minimal assumptions on the adaptive treatment policy. Without any structural assumptions on the counterfactual means, this challenging task is infeasible due to more unknowns than observed data points. To make progress, we introduce a latent factor model over the counterfactual means that serves as a non-parametric generalization of the non-linear mixed effects model and the bilinear latent factor model considered in prior works. For estimation, we use a non-parametric method, namely a variant of nearest neighbors, and establish a non-asymptotic high probability error bound for the counterfactual mean for each unit and each time. Under regularity conditions, this bound leads to asymptotically valid confidence intervals for the counterfactual mean as the number of units and time points grows to ∞ together at suitable rates. We illustrate our theory via several simulations and a case study involving data from a mobile health clinical trial HeartSteps.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 30 of its 94 references that are in the map. First posted on arXiv 14 Feb 2022.

Builds on

30 of 94 references.

References · 30

  1. 2017A Tutorial on Thompson Samplingcited by 420
  2. 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 117
  3. 2019Sequential Recommender Systems: Challenges, Progress and Prospectscited by 115
  4. 2019Confidence Intervals for Policy Evaluation in Adaptive Experimentscited by 95
  5. 2019Personalized HeartSteps: A Reinforcement Learning Algorithm for Optimizing Physical Activitycited by 70
  6. 2020Inference for Batched Banditscited by 63
  7. 2019Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradientscited by 51
  8. 2021Kernel Thinningcited by 47
  9. 2021Causal Matrix Completioncited by 45
  10. 2018Synthetic Difference in Differencescited by 41
  11. 2021Statistical Inference with M-Estimators on Adaptively Collected Datacited by 40
  12. 2021Off-Policy Evaluation via Adaptive Weighting with Data from Contextual Banditscited by 40
18 more
  1. 2019Inference and Uncertainty Quantification for Noisy Matrix Completioncited by 39
  2. 2016A Reinforcement Learning System to Encourage Physical Activity in Diabetes Patientscited by 38
  3. 2018Singularity, Misspecification, and the Convergence Rate of EMcited by 38
  4. 2021Post-Contextual-Bandit Inferencecited by 32
  5. 2021Generalized Kernel Thinningcited by 29
  6. 2021Stochastic Bandits for Multi-platform Budget Optimization in Online Advertisingcited by 25
  7. 2020IntelligentPooling: Practical Thompson Sampling for mHealthcited by 24
  8. 2019Sharp Analysis of Expectation-Maximization for Weakly Identifiable Modelscited by 23
  9. 2021Distribution Compression in Near-linear Timecited by 19
  10. 2020Stable discovery of interpretable subgroups via calibration in causal studiescited by 18
  11. 2017Fast MCMC sampling algorithms on polytopescited by 17
  12. 2018Contextual Multi-Armed Bandits for Causal Marketingcited by 17
  13. 2020Instability, Computational Efficiency and Statistical Accuracycited by 12
  14. 2020Curating a COVID-19 data repository and forecasting county-level death counts in the United Statescited by 10
  15. 2020Panel Experiments and Dynamic Causal Effects: A Finite Population Perspectivecited by 8
  16. 2020Revisiting minimum description length complexity in overparameterized modelscited by 7
  17. 2016The power of online thinning in reducing discrepancycited by 5
  18. 2013Uncertainty in Online Experiments with Dependent Data: An Evaluation of Bootstrap Methodscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 6; 2025: 3; 2026: 1.

13 papers.

Sort: