Search arXivSearch

arXiv · 2202.03892

Validity of tests for time-to-event endpoints in studies with the Pocock and Simon covariate-adaptive randomization

Abstract

In the presence of prognostic covariates, inference about the treatment effect with time-to-event endpoints is mostly conducted via the stratified log-rank test or the score test based on the Cox proportional hazards model. In their ground-breaking work Ye and Shao (2020) have demonstrated theoretically that when the model is misspecified, the robust score test (Wei and Lin, 1989) as well as the unstratified log-rank test are conservative in trials with stratified randomization. This fact, however, was not established for the Pocock and Simon covariate-adaptive allocation other than through simulations. In this paper, we expand the results of Ye and Shao to a more general class of randomization procedures and show, in part theoretically, in part through simulations, that the Pocock and Simon covariate-adaptive allocation belongs to this class. We also advance the search for the correlation structure of the normalized within-stratum imbalances with minimization by describing the asymptotic correlation matrix for the case of equal prevalence of all strata. We expand the robust tests proposed by Ye and Shao for stratified randomization to minimization and examine their performance trough simulations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victoria P. Johnson, Michael Gekhtman, Olga M. Kuznetsova. 2022-02-08. Validity of tests for time-to-event endpoints in studies with the Pocock and Simon covariate-adaptive randomization. https://arxiv.org/abs/2202.03892

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST