On the almost sure convergence of adaptive allocation procedures

From MaRDI portal
Publication:2348729

DOI10.3150/13-BEJ591zbMATH Open1320.62189arXiv1212.0637OpenAlexW3104964616MaRDI QIDQ2348729FDOQ2348729


Authors: Alessandro Baldi Antognini, Maroussa Zagoraiou Edit this on Wikidata


Publication date: 15 June 2015

Published in: Bernoulli (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1212.0637




Recommendations



Cites Work


Cited In (10)





This page was built for publication: On the almost sure convergence of adaptive allocation procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348729)