Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Near-Optimal A-B Testing
by
Moallemi, Ciamac C.
, Bhat, Nikhil
, Sinha, Deeksha
, Farias, Vivek F.
in
Algorithms
/ Management research
2020
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Near-Optimal A-B Testing
by
Moallemi, Ciamac C.
, Bhat, Nikhil
, Sinha, Deeksha
, Farias, Vivek F.
in
Algorithms
/ Management research
2020
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Near-Optimal A-B Testing
2020
Request Book From Autostore
and Choose the Collection Method
Overview
We consider the problem of A-B testing when the impact of the treatment is marred by a large number of covariates. Randomization can be highly inefficient in such settings, and thus we consider the problem of optimally allocating test subjects to either treatment with a view to maximizing the precision of our estimate of the treatment effect. Our main contribution is a tractable algorithm for this problem in the online setting, where subjects arrive, and must be assigned, sequentially, with covariates drawn from an elliptical distribution with finite second moment. We further characterize the gain in precision afforded by optimized allocations relative to randomized allocations, and show that this gain grows large as the number of covariates grows. Our dynamic optimization framework admits several generalizations that incorporate important operational constraints such as the consideration of selection bias, budgets on allocations, and endogenous stopping times. In a set of numerical experiments, we demonstrate that our method simultaneously offers better statistical efficiency and less selection bias than state-of-the-art competing biased coin designs.
Publisher
Institute for Operations Research and the Management Sciences
Subject
This website uses cookies to ensure you get the best experience on our website.