REVIEW 2 cited by
Counterfactual inference in sequential experiments
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
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 $\infty$ together at suitable rates. We illustrate our theory via several simulations and a case study involving data from a mobile health clinical trial HeartSteps.
Forward citations
Cited by 2 Pith papers
-
Two-way Deconfounder for Off-policy Evaluation in Causal Reinforcement Learning
A two-way deconfounder algorithm that models unmeasured confounders as per-trajectory and per-timestep latent factors and uses a neural tensor network for off-policy evaluation.
-
Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion
A two-sided nearest-neighbor estimator is claimed to match the oracle minimax rate for matrix completion under Holder-smooth, possibly non-Lipschitz latent factor models, even when entries are missing not at random.
Discussion (0). Continue with ORCID to comment.