arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1212.0637stat.ME
收藏

自适应分配过程的几乎处处收敛性

On the almost sure convergence of adaptive allocation procedures

Alessandro Baldi Antognini, Maroussa Zagoraiou

摘要:

在本文中,我们提供了一些一般的自适应设计的治疗比较,在存在和不存在协变量的收敛结果。特别是,我们证明了几乎肯定收敛的治疗分配比例的一个巨大的类的自适应程序,还包括设计,还没有正式调查,但主要是通过模拟,如阿特金森的最佳偏硬币设计,波考克和西蒙的最小化方法和它的一些概括。即使在文献中的绝大多数建议依赖于连续分配规则,我们的研究结果允许通过一个独特的数学框架,证明基于连续和不连续的随机化函数的自适应分配方法的收敛性。虽然早期作品的几个例子,以提高适用性,我们的方法提供了大量的见解,为未来的建议,特别是在没有一个前缀的目标和分配规则的序列为特征的设计。

英文摘要:

In this paper, we provide some general convergence results for adaptive designs for treatment comparison, both in the absence and presence of covariates. In particular, we demonstrate the almost sure convergence of the treatment allocation proportion for a vast class of adaptive procedures, also including designs that have not been formally investigated but mainly explored through simulations, such as Atkinson's optimum biased coin design, Pocock and Simon's minimization method and some of its generalizations. Even if the large majority of the proposals in the literature rely on continuous allocation rules, our results allow to prove via a unique mathematical framework the convergence of adaptive allocation methods based on both continuous and discontinuous randomization functions. Although several examples of earlier works are included in order to enhance the applicability, our approach provides substantial insight for future suggestions, especially in the absence of a prefixed target and for designs characterized by sequences of allocation rules.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑