Asymptotic Representations for Sequential Decisions, Adaptive Experiments, and Batched Bandits
We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect the observation of variables in later stages, our asymptotic representation characterizes all limit distributions attainable through a joint choice of an adaptive design rule and statistics applied to the adaptively generated data. This facilitates local power analysis of tests, comparison of adaptive treatments rules, and other analyses of batchwise sequential statistical decision rules.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descent
With the fast development of big data, it has been easier than before to learn the optimal decision rule by updating the decision rule recursively and making online decisions. We study the online statistical inference of…
Decision MakingMulti-Armed BanditsSequential Decision MakingAn Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
We study the $K$-armed dueling bandit problem, a variation of the traditional multi-armed bandit problem in which feedback is obtained in the form of pairwise comparisons. Previous learning algorithms have focused on the…
Recommendation SystemsDeep Adaptive Design: Amortizing Sequential Bayesian Experimental Design
We introduce Deep Adaptive Design (DAD), a method for amortizing the cost of adaptive Bayesian experimental design that allows experiments to be run in real-time. Traditional sequential Bayesian optimal experimental desi…
Experimental DesignEfficient Adaptive Experimental Design for Average Treatment Effect Estimation
We study how to efficiently estimate average treatment effects (ATEs) using adaptive experiments. In adaptive experiments, experimenters sequentially assign treatments to experimental units while updating treatment assig…
Experimental DesignvalidAdaptive Low-Complexity Sequential Inference for Dirichlet Process Mixture Models
We develop a sequential low-complexity inference procedure for Dirichlet process mixtures of Gaussians for online clustering and parameter estimation when the number of clusters are unknown a-priori. We present an easily…
ClusteringOnline Clusteringparameter estimation