Double machine learning and design in batch adaptive experiments
Harrison H. Li, Art B. Owen

TL;DR
This paper develops a semiparametric estimator for multi-stage experiments that adaptively learns treatment assignment probabilities to maximize precision, avoiding discretization and improving efficiency.
Contribution
It introduces a novel pooled estimator for multi-batch experiments and a flexible, rate-efficient method for learning propensity scores adaptively.
Findings
The proposed estimator outperforms single-batch methods in asymptotic efficiency.
Adaptive propensity score learning achieves targeted precision with weak convergence rates.
Avoiding discretization preserves more information and enhances estimation accuracy.
Abstract
We consider an experiment with at least two stages or batches and subjects per batch. First, we propose a semiparametric treatment effect estimator that efficiently pools information across the batches, and show it asymptotically dominates alternatives that aggregate single batch estimates. Then, we consider the design problem of learning propensity scores for assigning treatment in the later batches of the experiment to maximize the asymptotic precision of this estimator. For two common causal estimands, we estimate this precision using observations from previous batches, and then solve a finite-dimensional concave maximization problem to adaptively learn flexible propensity scores that converge to suitably defined optima in each batch at rate . By extending the framework of double machine learning, we show this rate suffices for our pooled estimator to attain the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Statistical Methods and Inference · Statistical Methods in Clinical Trials
