.png){kind=icon}
.png){kind=icon}
Return
Implementing optimal allocation in sequential binary response experiments
.png){kind=icon}
PRE
AI
DOI：10.1198/016214506000000906.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For sequential experiments with K treatments, we establish two formal optimization criteria to find optimal allocation strategies. Both criteria involve the sample sizes on each treatment and a concave noncentrality parameter from a multivariate test. We show that these two criteria are equivalent. We apply this result to specific questions: (1) How do we maximize power of a multivariate test of homogeneity with binary response?, and (2) for fixed power, how do we minimize expected treatment failures? Because the solutions depend on unknown parameters, we describe a response-adaptive randomization procedure that targets the optimal allocation and provides increases in power along the lines of 2-4% over complete randomization for equal allocation. The increase in power contradicts the conclusions of other authors who have explored other randomization procedures for K = 2 and have found that the variability induced by randomization negates any benefit of targeting an optimal allocation.
Keywords:
clinical trials
doubly adaptive biased coin design
Neyman allocation
power
response-adaptive randomization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3
Papers:
5.1K
Citations:
4.8W
Organization
No organization information available