Semiparametric Efficient Inference in Adaptive Experiments

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Cook, Thomas, Mishler, Alan, Ramdas, Aaditya
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911788353716224
author Cook, Thomas
Mishler, Alan
Ramdas, Aaditya
author_facet Cook, Thomas
Mishler, Alan
Ramdas, Aaditya
contents We consider the problem of efficient inference of the Average Treatment Effect in a sequential experiment where the policy governing the assignment of subjects to treatment or control can change over time. We first provide a central limit theorem for the Adaptive Augmented Inverse-Probability Weighted estimator, which is semiparametric efficient, under weaker assumptions than those previously made in the literature. This central limit theorem enables efficient inference at fixed sample sizes. We then consider a sequential inference setting, deriving both asymptotic and nonasymptotic confidence sequences that are considerably tighter than previous methods. These anytime-valid methods enable inference under data-dependent stopping times (sample sizes). Additionally, we use propensity score truncation techniques from the recent off-policy estimation literature to reduce the finite sample variance of our estimator without affecting the asymptotic variance. Empirical results demonstrate that our methods yield narrower confidence sequences than those previously developed in the literature while maintaining time-uniform error control.
format Preprint
id arxiv_https___arxiv_org_abs_2311_18274
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Semiparametric Efficient Inference in Adaptive Experiments
Cook, Thomas
Mishler, Alan
Ramdas, Aaditya
Machine Learning
Methodology
We consider the problem of efficient inference of the Average Treatment Effect in a sequential experiment where the policy governing the assignment of subjects to treatment or control can change over time. We first provide a central limit theorem for the Adaptive Augmented Inverse-Probability Weighted estimator, which is semiparametric efficient, under weaker assumptions than those previously made in the literature. This central limit theorem enables efficient inference at fixed sample sizes. We then consider a sequential inference setting, deriving both asymptotic and nonasymptotic confidence sequences that are considerably tighter than previous methods. These anytime-valid methods enable inference under data-dependent stopping times (sample sizes). Additionally, we use propensity score truncation techniques from the recent off-policy estimation literature to reduce the finite sample variance of our estimator without affecting the asymptotic variance. Empirical results demonstrate that our methods yield narrower confidence sequences than those previously developed in the literature while maintaining time-uniform error control.
title Semiparametric Efficient Inference in Adaptive Experiments
topic Machine Learning
Methodology
url https://arxiv.org/abs/2311.18274