alphaFeedback

WorksMathematics

Adaptive stopping and forecasting of screening, rescreening and randomization in multicentre clinical trials

AI contributions
Not recorded for this paper
View details

Abstract

In randomised clinical trials, patients typically undergo some screening stages before randomisation. These stages complicate design as patients may be randomised after admissions to screening have been halted. Stopping the admission of new patients too late may lead to over-enrolment, as more patients than planned are randomised, increasing costs, unnecessary patient exposure and the time required to complete recruitment. Stopping too early may result in failure to achieve the planned sample size. Predictions of the stopping time should therefore account for patients currently in screening and the number of the patients to be randomised. We present a novel statistical framework for joint modelling screening and randomisation and determining an adaptive stopping time to stop admitting new patients to screening before the planned randomisation target is reached. The aim is to reduce over-enrolment while maintaining a high probability of achieving the target. We represent the screening and randomisation pathway as a multistage process with stage-specific durations and transition probabilities estimated from trial data. The model yields the distribution of the number of patients who will be randomised from the current screening pipeline and the probability of reaching the planned randomisation target. If this probability exceeds a specified threshold, such as 95% or 99%, admission of new patients to screening should be stopped. Otherwise, the model is updated as additional data accrue and is used to forecast future pipeline and the stopping time. The framework can incorporate scheduled site initiations and future closures using evolving stochastic processes, and supporting forecasts at global, regional and country levels. Illustrative simulations show that the approach can reduce over-enrolment substantially while preserving a high probability of reaching the target sample size.

Introduction

Forecasting patient arrivals, the screening pipeline and the times at which operational targets will be reached is an important challenge in large multicentre clinical trials. Such trials often aim to enrol substantial numbers of participants in order to achieve the sample size required for testing the prespecified scientific hypotheses.

An early and commonly used approach modelled patient arrivals as Poisson processes with fixed site-specific rates; see, for example, [11]. In practice, however, enrolment rates vary substantially between sites. To represent this heterogeneity, Anisimov and Fedorov [1] (see also [2]) introduced and popularised the Poisson–gamma (PG) model. In this model, patient arrivals at each site follow a Poisson process, while the site-specific rates are drawn from a gamma distribution.

The PG model [1, 2] has subsequently become one of the most widely used and robust frameworks for forecasting enrolment and has been described in the literature as both “one of the most popular techniques” and an “industry standard” model. It has also been extended in several directions; see, for example, [5]. Reviews of alternative approaches are provided in [4, 9, 10].

Real-world trials, however, typically include one or more screening stages that patients must complete before randomisation, and the structure of the screening pathway is trial-specific. In this paper, we consider trials with screening and rescreening before randomisation. Our aim is to provide practical guidance on stopping the admission of new patients to screening before the randomisation target is reached. This can reduce over-enrolment caused by patients who remain in the screening pipeline at the stopping time and are subsequently randomised, while maintaining a high probability of achieving the target.

It is also often necessary to consider randomisation targets for particular countries or regions. Country-level forecasts can be used to estimate the time required to meet minimum recruitment requirements and to coordinate enrolment schedules so that these requirements are satisfied by the time the overall randomisation target is reached.

An approach to the joint modelling and forecasting of arrival and screening processes, including screening and prescreening stages and an early stopping rule, was proposed by the first author at the Conference on Advances in Statistics [7]. Extended results for that screening pathway were presented at the 21st ASMDA Conference, held in Piraeus, Greece, on 10–13 June 2025, and are reported in [8].

In this paper, we consider the more widely used pathway comprising screening followed, where applicable, by rescreening. The principal contribution is a framework that introduces explicit screening stages between patient arrival and randomisation and can be adapted to different screening pathways given suitable probability functions. The distribution of the number of patients randomised after completing these stages is used to derive an operational stopping rule. This rule is combined with forecasts of future arrivals to predict the earliest monitoring time at which the probability threshold to stop admitting new patients to screening is met.

We also extend the future-arrival model to account for finite site recruitment windows, which can affect the timing and volume of patient arrivals and subsequent randomisations. We treat these recruitment windows as predetermined, and derive the corresponding site contributions to model future randomisations under a proposed schedule, supporting forecasts at global, country and regional levels.

The remainder of the paper is organised as follows. We first describe the screening and rescreening pathway and formulate the corresponding mathematical model. We then derive the distribution of the number of randomisations among patients currently in screening or rescreening and extend the model to patients who will arrive in the future. Finally, we present the forecasting and stopping procedure and quantify the resulting risk and expected magnitude of over-enrolment.

Structure of the screening pathway

Screening, rescreening and randomisation

Consider a multicentre clinical trial in which patients complete a screening process, with an associated delay, before being randomised into the trial. We focus on a screening/rescreening pathway in which patients may be randomised through either of two routes. They may be randomised directly after an initial screening period of length Δ1\Delta_1, or, following an initial screening failure, they may enter a rescreening period of length Δ2\Delta_2 after a delay of length DD. Figure 1 illustrates this pathway.

Patient flow through the screening and rescreening pathway

Figure 1. Patient flow through the screening and rescreening pathway, with the associated transition probabilities

Forecasting at an interim time

At an interim time t1t_1, the numbers of patients currently in screening, n1n_1, and rescreening, n2n_2, and the additional randomisations required to reach the target, LL, are known. The forecast must therefore account for two groups: patients currently in screening or rescreening and patients arriving after t1t_1.

Randomisation from the screening pool

To model screening and randomisation at interim time t1t_1, we use information on the patients’ progression through the screening stages. Specifically, we consider the number of patients already randomised, the numbers currently in initial screening and rescreening, and the transition probabilities at each stage. These parameters are treated as fixed in the derivations, but in practice they are estimated from interim data once sufficient information has accumulated, as described below.

Table 1 defines the observed counts, stage-specific probabilities and process durations. The probabilities and durations are assumed known for the following derivations. The number of additional randomisations required to reach the target is L=R−R(t1)L = R - R(t_1).

SymbolDefinition
t1t_1Interim forecasting time
RRPlanned randomisation target
R(t1)R(t_1)Number of patients already randomised by t1t_1
LLAdditional randomisations required, R−R(t1)R - R(t_1)
n1n_1Number of patients currently in initial screening
n2n_2Number of patients currently in rescreening
p1p_1Probability of randomisation directly after initial screening
rrProbability of entering rescreening following initial screening failure
p2p_2Probability of randomisation for a patient in rescreening
Δ1\Delta_1Duration of initial screening
DDDelay between initial screening and rescreening
Δ2\Delta_2Duration of rescreening

Table 1. Notation for forecasting randomisation from the current screening pool.

Using this information, we aim to predict how many patients already in screening or rescreening will eventually be randomised and when these randomisations are expected to occur.

For n1n_1 patients currently in initial screening, let aja_j denote the completion times in the interval [t1,t1+Δ1][t_1, t_1 + \Delta_1]. Similarly, for n2n_2 patients currently in rescreening, let vjv_j denote the completion times in [t1,t1+Δ2][t_1, t_1 + \Delta_2]. Under homogeneous Poisson arrivals, conditional on the number of patients in that stage their entry times are uniformly distributed over the corresponding preceding stage-duration. With fixed stage durations, their completion times are thus uniform between the interim time and the interim time plus the stage duration. For forecasts based on stage counts alone, uniform remaining completion times provide an approximation when entries to the relevant stages are approximately stable. If individual entry dates are available, the corresponding completion times can be used directly under the fixed-duration model.

Model parameters and estimation from interim data

The screening and rescreening parameters should be estimated from accumulated data. There are two main groups of parameters. The first describes the structure of the screening pathway, and the second describes the rate at which patients arrive at each site. These components can be estimated separately: the pathway parameters are required to analyse patients already observed in screening or rescreening, whereas the arrival-rate parameters are required to forecast future patients. Both groups are needed to characterise future randomisations.

Estimation of screening and rescreening parameters

For the initial screening stage, let m1m_1 be the number of patients who have completed initial screening by t1t_1, and let s1s_1 be the number of patients who were randomised out of these m1m_1 patients directly after initial screening. Let mrm_r be the number of patients who entered rescreening after failing initial screening. For the rescreening stage, let m2m_2 be the number of patients who have completed rescreening by t1t_1, and let s2s_2 be the number who were successfully randomised after rescreening. The transition probabilities are then estimated by

p^1=s1m1,r^=mrm1−s1,p^2=s2m2.\widehat{p}_1 = \frac{s_1}{m_1}, \qquad\widehat{r} = \frac{m_r}{m_1-s_1}, \qquad\widehat{p}_2 = \frac{s_2}{m_2}.

If the relevant sample sizes are small, or if limited trial data have accumulated for a particular stage, information can be pooled across suitable sites within the same country or region to estimate the model parameters. Alternatively, estimates may be borrowed from comparable studies or obtained using Bayesian methods.

The stage durations can also be estimated from patient-level data. Denote the corresponding empirical estimates by

Δ^1=mean initial screening duration,\widehat{\Delta}_1 = \text{mean initial screening duration},
D^=mean delay between screen failure and rescreening entry,\widehat{D} = \text{mean delay between screen failure and rescreening entry},
Δ^2=mean rescreening duration.\widehat{\Delta}_2 = \text{mean rescreening duration}.

In many studies, however, the screening and rescreening windows are specified in the protocol. In such cases, the duration parameters can be treated as fixed constants rather than estimated directly from the data.

Site-level arrival parameters

To forecast randomisations among patients who have not yet arrived, we must model the patient-arrival process. For each site jj, suppose that, at interim time t1t_1, the site has been active for wjw_j days and that kjk_j patients have entered initial screening during this period.

The site-level arrival process is modelled as a Poisson–gamma process with a site-specific rate λj\lambda_j. This rate has a gamma prior with shape parameter αj\alpha_j and rate parameter βj\beta_j, with mean αj/βj\alpha_j/\beta_j and variance αj/βj2\alpha_j/\beta_j^2.

For a site jj that is already active at time t1t_1, Bayesian updating gives a gamma posterior distribution: λj∼Ga⁡(αj+kj,βj+wj)\lambda_j \sim\operatorname{Ga}(\alpha_j+k_j,\beta_j+w_j). This posterior better reflects the site’s observed performance. Estimates for sites with substantial accrued data are driven mainly by their own observations, whereas sites with limited history borrow more information from the prior distribution.

For sites that have not yet opened at t1t_1, the arrival rate can be represented by the prior or predictive distribution λj∼Ga⁡(αj,βj)\lambda_j \sim\operatorname{Ga}(\alpha_j,\beta_j), where (αj,βj)(\alpha_j,\beta_j) may be estimated from comparable sites.

Eventual randomisations from the current screening pool

To determine an early stopping time that reduces over-enrolment, we first quantify the probability of reaching the target using only patients already observed in the trial. Specifically, we derive the distribution of the number of randomisations among the n1n_1 patients in initial screening and the n2n_2 patients in rescreening. This distribution yields a stopping rule: if the probability that these patients will provide enough randomisations to reach the target exceeds a chosen threshold qq, admission of new patients to screening should stop; otherwise, it should continue.

Let X∞X_\infty denote the final number of randomisations among patients currently in screening or rescreening.

Using the structure of the screening pathway, X∞X_{\infty} can be represented as the sum of two random variables where we account for two cases: a patient currently in initial screening can be randomised either directly after initial screening or after rescreening. Thus, the following equality holds in distribution:

X∞=dBin⁡(n1,p1+(1−p1)rp2)+Bin⁡(n2,p2)X_{\infty} \overset{d}{=} \operatorname{Bin}(n_{1},p_{1}+(1-p_{1})rp_{2})+\operatorname{Bin}(n_{2},p_{2})

where the two binomial random variables on the right-hand side are independent.

For a suitably high threshold qq, the decision rule is

P(X∞≥L)≥q\mathbb{P}(X_{\infty}\ge L)\ge q

where LL is the number of additional randomisations required to reach the target. If this condition holds, admission of new patients to screening should be stopped.

Here, qq is the required probability of reaching the target using the observed screening pool. To limit the risk of under-enrolment, qq should be high; for example, q=0.99q=0.99. A lower value reduces over-enrolment but increases the risk of failing to reach the target. A higher value reduces the risk of under-enrolment, although it may prolong screening and modestly increase over-enrolment. Because under-enrolment should be minimised, a high threshold is generally appropriate. The calculations below indicate that increasing qq produces only a relatively small increase in over-enrolment.

The distribution of X∞X_{\infty} can also be used to estimate the probability of exceeding specified levels of over-enrolment by varying the value of LL.

Randomisations from the current screening pool by time tt

At interim time t1t_{1}, suppose that n1n_{1} patients are in initial screening and n2n_{2} are in rescreening. We use the uniform completion time assumption as described in § 3. Thus, for a patient in initial screening, the probability of completing initial screening by time tt is

α1(t)=t−t1Δ1∧1∨0.\alpha_{1}(t)=\frac{t-t_{1}}{\Delta_{1}}\wedge1\vee0.

Similarly, the probability that a patient completes the full screening and rescreening pathway by time tt, including the delay DD and rescreening duration Δ2\Delta_{2}, is

α2(t)=t−t1−D−Δ2Δ1∧1∨0.\alpha_{2}(t)=\frac{t-t_{1}-D-\Delta_{2}}{\Delta_{1}}\wedge1\vee0.

Finally, for a patient in rescreening at time t1t_{1}, the probability of completing rescreening by time tt is

γ(t)=t−t1Δ2∧1∨0.\gamma(t)=\frac{t-t_{1}}{\Delta_{2}}\wedge1\vee0.

We now incorporate the success probabilities for each stage. A patient in initial screening can be randomised by time tt either directly after initial screening or after rescreening. Direct randomisation occurs with probability α1(t)p1\alpha_{1}(t)p_{1}, because the patient must both complete initial screening by time tt and pass that stage.

For randomisation after rescreening, the patient must have entered early enough to complete the entire screening/rescreening pathway by time tt, failed initial screening, entered rescreening and passed rescreening. This occurs with probability α2(t)(1−p1)rp2\alpha_{2}(t)(1-p_{1})rp_{2}. Therefore, the overall probability that a patient currently in initial screening is randomised by time tt is

A(t)=α1(t)p1+α2(t)(1−p1)rp2.A(t)=\alpha_{1}(t)p_{1}+\alpha_{2}(t)(1-p_{1})rp_{2}.

For a patient currently in rescreening, the corresponding probability of randomisation by time tt is γ(t)p2\gamma(t)p_{2}. Let X(t)X(t) denote the number of patients randomised by time tt among those currently in initial screening or rescreening. Then

X(t)=dBin⁡(n1,A(t))+Bin⁡(n2,γ(t)p2),X(t)\overset{d}{=}\operatorname{Bin}(n_{1},A(t))+\operatorname{Bin}(n_{2},\gamma(t)p_{2}),

where the two terms account for patients in initial screening and rescreening, respectively.

The corresponding mean and variance are

E[X(t)]=n1A(t)+n2γ(t)p2,Var⁡(X(t))=n1A(t)(1−A(t))+n2γ(t)p2(1−γ(t)p2).\begin{aligned} \mathbb{E}[X(t)] &= n_1 A(t) + n_2 \gamma(t) p_2,\\ \operatorname{Var}(X(t)) &= n_1 A(t)(1-A(t)) + n_2 \gamma(t) p_2(1-\gamma(t)p_2). \end{aligned}

The full distribution of X(t)X(t) can be obtained by convolving the two binomial distributions.

As t→∞t \to\infty, α1(t)→1\alpha_1(t) \to1, α2(t)→1\alpha_2(t) \to1, γ(t)→1\gamma(t) \to1.

Hence, X(t)X(t) converges in distribution to X∞X_\infty.

Stopping rule and over-enrolment risks

Probability threshold for stopping screening admissions

Because the distribution of X(t)X(t) is available, we can formulate strategies for deciding when to stop admitting new patients to screening.

Consider a future time ss at which the randomisation target has not yet been reached and a decision must be made about whether to stop admitting new patients. Let RR be the planned randomisation target, and let Ωs\Omega_s denote the interim information available at time ss. This information includes the number of patients already randomised, R(s)R(s), and the numbers currently in screening and rescreening, n1(s)n_1(s) and n2(s)n_2(s), respectively. Define the number of additional randomisations required to reach the target by L(s)=R−R(s)L(s)=R-R(s). If admission of new patients is stopped at time ss, let W∞(s)∣ΩsW_\infty(s)\mid\Omega_s denote the eventual number of randomisations among patients already in the screening/rescreening pipeline. Thus, W∞(s)W_\infty(s) is the time-ss update of X∞X_\infty, based on n1(s)n_1(s) and n2(s)n_2(s). Conditional on Ωs\Omega_s,

W∞(s)∣Ωs=dBin⁡(n1(s),p1+(1−p1)rp2)+Bin⁡(n2(s),p2).W_\infty(s)\mid\Omega_s \mathrel{\overset{d}{=}} \operatorname{Bin}\left(n_1(s),p_1+(1-p_1)rp_2\right)+\operatorname{Bin}\left(n_2(s),p_2\right).

Admission of new patients to screening should therefore stop at time ss if

P(W∞(s)≥L(s)∣Ωs)≥q\mathbb{P}\left(W_\infty(s)\ge L(s)\mid\Omega_s\right)\ge q

for a chosen probability threshold qq, such as 95% or 99%. Otherwise, admission of new patients to screening should continue.

Over-enrolment risk

If admission of new patients is stopped on day ss, define the resulting over-enrolment, conditional on the observed data, by

Qs=max⁡(W∞(s)−L(s),0).Q_s=\max(W_\infty(s)-L(s),0).

Conditional on Ωs\Omega_s, the distribution of QsQ_s is determined by the distribution of W∞(s)W_\infty(s):

P(Qs=k∣Ωs)=P(W∞(s)=L(s)+k∣Ωs),k≥1,P(Qs=0∣Ωs)=P(W∞(s)≤L(s)∣Ωs).\begin{aligned} \mathbb{P}(Q_s=k\mid\Omega_s)&=\mathbb{P}(W_\infty(s)=L(s)+k\mid\Omega_s), \qquad k\ge1,\\ \mathbb{P}(Q_s=0\mid\Omega_s)&=\mathbb{P}(W_\infty(s)\le L(s)\mid\Omega_s). \end{aligned}

The expected over-enrolment can be calculated as

E[Qs∣Ωs]=∑k=L(s)+1n1(s)+n2(s)(k−L(s))P(W∞(s)=k∣Ωs),\mathbb{E}[Q_s\mid\Omega_s]=\sum_{k=L(s)+1}^{n_1(s)+n_2(s)}(k-L(s))\mathbb{P}(W_\infty(s)=k\mid\Omega_s),

or

E[Qs∣Ωs]=∑k=L(s)+1n1(s)+n2(s)P(W∞(s)≥k∣Ωs).\mathbb{E}[Q_s\mid\Omega_s]=\sum_{k=L(s)+1}^{n_1(s)+n_2(s)}\mathbb{P}(W_\infty(s)\ge k\mid\Omega_s).

Randomisation process for patients arriving after the interim time

Arrival times and randomisation probabilities

If, at interim time t1t_1, the probability of reaching the target using only patients already in screening or rescreening is not sufficiently high, admission of new patients should continue. We must then account for patients who enter screening after t1t_1 and determine how many of them may be randomised by a future time tt. Let Y(t)Y(t) denote the number of patients randomised by time t>t1t > t_1 among those who enter screening after t1t_1. To derive the randomisation probability over time for an arriving patient, consider Poisson arrivals with a rate that, conditional on the site rate, is constant. This applies for example to an individual site over an active recruitment time. For u<tu < t, let U(u,t)U(u,t) denote the number of patients who arrive during the interval [u,t][u,t]. Conditional on U(u,t)=nU(u,t) = n, the arrival times y1,…,yny_1,\ldots,y_n are independent and uniformly distributed over [u,t][u,t]. For patient ii, let

Zi∼Bernoulli⁡(p1),Ri∼Bernoulli⁡(r),Gi∼Bernoulli⁡(p2),Z_i \sim\operatorname{Bernoulli}(p_1), \quad R_i \sim\operatorname{Bernoulli}(r), \quad G_i \sim\operatorname{Bernoulli}(p_2),

where ZiZ_i indicates successful initial screening, RiR_i indicates entry into rescreening after an initial-screening failure, and GiG_i indicates successful rescreening. These variables are assumed to be mutually independent and independent across patients. The indicator that patient ii has been randomised by time tt is therefore

Ii(u,t)=1{yi+Δ1≤t}Zi+1{yi+Δ1+D+Δ2≤t}(1−Zi)RiGi.I_i(u,t) = 1\{y_i + \Delta_1 \leq t\}Z_i + 1\{y_i + \Delta_1 + D + \Delta_2 \leq t\}(1-Z_i)R_iG_i.

Because yi∣{U(u,t)=n}∼Unif⁡[u,t]y_i \mid\{U(u,t) = n\} \sim\operatorname{Unif}[u,t], define the probabilities

q1(u,t)=(t−u−Δ1t−u)∧1∨0,q_1(u,t) = \left(\frac{t-u-\Delta_1}{t-u}\right) \wedge1 \vee0,
q2(u,t)=(t−u−Δ1−D−Δ2t−u)∧1∨0,q_2(u,t) = \left(\frac{t-u-\Delta_1-D-\Delta_2}{t-u}\right) \wedge1 \vee0,
h(u,t)=q1(u,t)p1+q2(u,t)(1−p1)rp2.h(u,t) = q_1(u,t)p_1 + q_2(u,t)(1-p_1)rp_2.

It follows that Ii(u,t)I_i(u,t) is a Bernoulli random variable with success probability h(u,t)h(u,t). Conditional on {U(u,t)=n}\{U(u,t) = n\}, the number of these patients randomised by time tt has a binomial distribution with parameters nn and h(u,t)h(u,t). This will be applied separately to the aggregation of the active sites and to each site opening in future in the following subsections.

Here, q1(u,t)q_1(u,t) is the probability that a patient whose arrival time is uniformly distributed over [u,t][u,t] completes initial screening by time tt. Similarly, q2(u,t)q_2(u,t) is the probability that the patient arrives early enough to complete initial screening, the delay DD, and rescreening by time tt. Hence, h(u,t)h(u,t) is the probability that a patient arriving after time uu is randomised by time tt.

Aggregate contribution from sites active at interim time

First consider sites that are already active at interim time t1t_1, so that their initiation times satisfy ui<t1u_i < t_1. For each site ii, let wi=t1−uiw_i = t_1-u_i be the length of its active enrolment period and let kik_i be the number of patients who arrived during this period. As described in § 4.2, under the Poisson–gamma model and after Bayesian updating, the posterior rate at site ii is

λi∣Ωt1∼Ga⁡(α+ki,β+wi),\lambda_i \mid\Omega_{t_1} \sim\operatorname{Ga}(\alpha+k_i,\beta+w_i),

where the common prior parameters (α,β)(\alpha,\beta), used across all sites, are estimated by maximum likelihood as described in [1, 2]. The aggregate posterior arrival rate across all active sites is

Λ^Act=∑ui<t1λi.\widehat{\Lambda}_{\mathrm{Act}} = \sum_{u_i<t_1}\lambda_i.

Anisimov and Austin [6] showed that Λ^Act\widehat{\Lambda}_{\mathrm{Act}} can be well approximated by a gamma-distributed random variable ΛAct\Lambda_{\mathrm{Act}} with mean and variance

E[ΛAct]=∑ui<t1α+kiβ+wi,Var⁡(ΛAct)=∑ui<t1α+ki(β+wi)2.\mathbb{E}[\Lambda_{\mathrm{Act}}] = \sum_{u_i<t_1}\frac{\alpha+k_i}{\beta+w_i}, \qquad\operatorname{Var}(\Lambda_{\mathrm{Act}}) = \sum_{u_i<t_1}\frac{\alpha+k_i}{(\beta+w_i)^2}.

If E[ΛAct]=0\mathbb{E}[\Lambda_{\mathrm{Act}}] = 0, as ΛAct\Lambda_{\mathrm{Act}} is non-negative, we have ΛAct=0\Lambda_{\mathrm{Act}} = 0 almost surely. Otherwise, when Var⁡(ΛAct)>0\operatorname{Var}(\Lambda_{\mathrm{Act}}) > 0, the distribution of ΛAct\Lambda_{\mathrm{Act}} can be approximated by a gamma distribution with parameters (AAct,BAct)(A_{\mathrm{Act}},B_{\mathrm{Act}}), where

AAct=E[ΛAct]2Var⁡(ΛAct),BAct=E[ΛAct]Var⁡(ΛAct).A_{\mathrm{Act}} = \frac{\mathbb{E}[\Lambda_{\mathrm{Act}}]^2}{\operatorname{Var}(\Lambda_{\mathrm{Act}})}, \qquad B_{\mathrm{Act}} = \frac{\mathbb{E}[\Lambda_{\mathrm{Act}}]}{\operatorname{Var}(\Lambda_{\mathrm{Act}})}.

For sites active at t1t_1, the arrival process over [t1,t][t_1,t] is therefore PG with cumulative rate (t−t1)ΛAct(t-t_1)\Lambda_{\mathrm{Act}}. Each arriving patient is randomised by time tt with aggregate throughput probability h(t1,t)h(t_1,t). By the thinning property of a Poisson process, the cumulative randomisation rate over [t1,t][t_1,t] is (t−t1)h(t1,t)ΛAct(t-t_1)h(t_1,t)\Lambda_{\mathrm{Act}}.

Randomisations from sites opening in the future

Consider a new site jj initiated at time uj≥t1u_j \ge t_1. Let its arrival rate, λj\lambda_j, be a gamma-distributed random variable with parameters (αj,βj)(\alpha_j, \beta_j). If country- or region-specific information is available, these parameters may be estimated from that information; otherwise, they may be derived from posterior information for active sites or from historical data.

Let Uj(uj,t)U_j(u_j,t) denote the number of patients arriving at site jj during [uj,t][u_j,t], and let Yj(uj,t)Y_j(u_j,t) be the corresponding number of randomisations at that site during the same interval. By the same argument as above, the conditional distribution of Yj(uj,t)Y_j(u_j,t), given Uj(uj,t)=nU_j(u_j,t)=n, is binomial:

[Yj(uj,t)∣Uj(uj,t)=n]∼Bin⁡(n,h(uj,t)).[Y_j(u_j,t) \mid U_j(u_j,t)=n] \sim\operatorname{Bin}(n,h(u_j,t)).

Applying the thinning property of a Poisson process, the unconditional distribution of Yj(uj,t)Y_j(u_j,t) is Poisson–gamma with cumulative gamma-distributed random rate

(t−uj)h(uj,t)λj.(t-u_j)h(u_j,t)\lambda_j.

The global randomisation process

Combining the contributions from active sites and sites opening in the future, the cumulative random rate for the global randomisation process Y(t)Y(t) over [t1,t][t_1,t] can be represented as

Λ(t)=d(t−t1)h(t1,t)ΛAct+∑t1≤uj<t(t−uj)h(uj,t)λj.\Lambda(t) \mathrel{\overset{d}{=}} (t-t_1)h(t_1,t)\Lambda_{\mathrm{Act}}+\sum_{t_1\leq u_j<t}(t-u_j)h(u_j,t)\lambda_j.

The process Y(t)Y(t) is therefore represented as an evolving stochastic process; see [3]. The mean and variance of the global random rate are given by

E[Λ(t)]=(t−t1)h(t1,t)E[ΛAct]+∑t1≤uj<t(t−uj)h(uj,t)αjβj,Var⁡(Λ(t))=(t−t1)2h2(t1,t)Var⁡(ΛAct)+∑t1≤uj<t(t−uj)2h2(uj,t)αjβj2.\begin{aligned} \mathbb{E}[\Lambda(t)] &= (t-t_1)h(t_1,t)\mathbb{E}[\Lambda_{\mathrm{Act}}]+\sum_{t_1\leq u_j<t}(t-u_j)h(u_j,t)\frac{\alpha_j}{\beta_j},\\ \operatorname{Var}(\Lambda(t)) &= (t-t_1)^2h^2(t_1,t)\operatorname{Var}(\Lambda_{\mathrm{Act}})+\sum_{t_1\leq u_j<t}(t-u_j)^2h^2(u_j,t)\frac{\alpha_j}{\beta_j^2}. \end{aligned}

Special case without rescreening randomisations

Consider the case where patients can only be randomised through initial screening, so that r=0r=0 and p2=0p_2=0. The general framework therefore reduces to a single pathway. In particular, the eventual number of randomisations from the current screening pool satisfies

X∞=dBin⁡(n1,p1),X_\infty\mathrel{\overset{d}{=}} \operatorname{Bin}(n_1,p_1),

and the number of randomisations by time tt among patients currently in screening satisfies

X(t)=dBin⁡(n1,α1(t)p1).X(t) \mathrel{\overset{d}{=}} \operatorname{Bin}(n_1,\alpha_1(t)p_1).

For patients arriving after the interim time, the probability of randomisation by time tt reduces to

h(u,t)=q1(u,t)p1.h(u,t)=q_1(u,t)p_1.

The future arrival distributions thus retain the same structure, but with simplified probabilities. The stopping rule and over-enrolment calculations apply using the corresponding single-binomial distribution.

Site closing time and recruitment windows

Site-level recruitment exposure

Let uju_j denote the opening time of site jj and cjc_j the time at which the site stops admitting new patients to initial screening. These are assumed to be predetermined. Note that all patients admitted before cjc_j are allowed to complete the full screening/rescreening pathway, so that the site may continue to contribute randomisations after cjc_j. If no recruitment closure is scheduled, cjc_j can be set to ∞\infty.

At interim time t1t_1 consider for each site the contributions to the forecast. The active exposure at site jj between t1t_1 and a future time tt is

wj(t1,t)=(min⁡(t,cj)−max⁡(t1,uj))+.w_j(t_1,t) = \left(\min(t,c_j)-\max(t_1,u_j)\right)_+.

where (x)+=max⁡(x,0)(x)_+ = \max(x,0). This represents the number of days during which the site is actively recruiting patients to initial screening between t1t_1 and tt. The active recruitment window is zero if the site is not open during the interval [t1,t][t_1,t].

Let λj\lambda_j be the arrival rate at site jj. For a site with observed recruitment data let αj,βj\alpha_j,\beta_j denote the posterior parameters, and for sites not yet open let αj,βj\alpha_j,\beta_j denote the prior parameters. The arrival rate is then λj∼Ga⁡(αj,βj)\lambda_j \sim\operatorname{Ga}(\alpha_j,\beta_j). Conditional on this rate, the number of patients entering screening during the active window satisfies

Uj(t1,t)∣λj∼Pois⁡(λjwj(t1,t)).U_j(t_1,t)\mid\lambda_j \sim\operatorname{Pois}\left(\lambda_j w_j(t_1,t)\right).

where Uj(t1,t)U_j(t_1,t) denotes the site-level arrival count.

Conditional on Uj(t1,t)=nU_j(t_1,t)=n, the arrival times are uniformly distributed on [max⁡(t1,uj),min⁡(t,cj)][\max(t_1,u_j),\min(t,c_j)]. For a non-empty active window, the corresponding stage completion and randomisation probabilities are

q1j(t1,t)=(t−max⁡(t1,uj)−Δ1min⁡(t,cj)−max⁡(t1,uj))∧1∨0,q_{1j}(t_1,t)=\left(\frac{t-\max(t_1,u_j)-\Delta_1}{\min(t,c_j)-\max(t_1,u_j)}\right)\wedge1\vee0,
q2j(t1,t)=(t−max⁡(t,uj)−Δ1−D−Δ2min⁡(t,cj)−max⁡(t1,uj))∧1∨0,q_{2j}(t_1,t)=\left(\frac{t-\max(t,u_j)-\Delta_1-D-\Delta_2}{\min(t,c_j)-\max(t_1,u_j)}\right)\wedge1\vee0,
hj(t1,t)=q1j(t1,t)p1+q2j(t1,t)(1−p1)rp2.h_j(t_1,t)=q_{1j}(t_1,t)p_1+q_{2j}(t_1,t)(1-p_1)rp_2.

Here hj(t1,t)h_j(t_1,t) is the probability that a patient arriving at site jj during the active window is randomised by time tt.

If wj(t1,t)=0w_j(t_1,t)=0, set q1j(t1,t)=q2j(t)=hj(t1,t)=0q_{1j}(t_1,t)=q_{2j}(t)=h_j(t_1,t)=0 to avoid accounting for sites with zero exposure.

Let Yj(t1,t)Y_j(t_1,t) denote the number of randomisations by time tt among these new arrivals. Under the existing independence assumptions and with fixed screening probabilities,

Yj(t1,t)∣{Uj(t1,t)=n}∼Bin⁡(n,hj(t1,t)).Y_j(t_1,t)\mid\{U_j(t_1,t)=n\}\sim\operatorname{Bin}(n,h_j(t_1,t)).

Equivalently, by Poisson thinning,

Yj(t1,t)∣λj∼Pois⁡(λjwj(t1,t)hj(t1,t)).Y_j(t_1,t)\mid\lambda_j\sim\operatorname{Pois}\left(\lambda_jw_j(t_1,t)h_j(t_1,t)\right).

Note that if cj=∞c_j=\infty, the recruitment window becomes [max⁡(t1,uj),t][\max(t_1,u_j),t], and thus the functions q1j,q2j,hjq_{1j},q_{2j},h_j reduce to the previous definitions.

Site-level rates and aggregations

We now apply the same gamma moment-matching technique as in the open-site model, but first calculate the contribution of each site using its own opening and closing times. This accounts for sites already active at t1t_1, sites opening subsequently, and sites that stop admitting patients during the forecasting period. A site that has closed screening may still contribute randomisations from patients admitted after t1t_1 but before its cjc_j. Patients already in the screening pool at t1t_1 remain part of X(t)X(t) and are not considered by the future-arrival component.

Define the site-level cumulative rate by

Λj(t1,t)=wj(t1,t)hj(t1,t)λj.\Lambda_j(t_1,t)=w_j(t_1,t)h_j(t_1,t)\lambda_j.

Thus, the site-level predictive count is Poisson–gamma, with rate moments

E[Λj(t1,t)]=wj(t1,t)hj(t1,t)αjβj,\mathbb{E}[\Lambda_j(t_1,t)]=w_j(t_1,t)h_j(t_1,t)\frac{\alpha_j}{\beta_j},
Var⁡(Λj(t1,t))=wj2(t1,t)hj2(t1,t)αjβj2.\operatorname{Var}(\Lambda_j(t_1,t))=w_j^2(t_1,t)h_j^2(t_1,t)\frac{\alpha_j}{\beta_j^2}.

The site opening and closing times and screening probabilities are treated as fixed, and the site-specific arrival rates and patient processes are assumed independent. Summing over all sites gives

Y(t)=∑jYj(t1,t),Λ(t)=∑jΛj(t1,t).Y(t) = \sum_j Y_j(t_1,t), \qquad\Lambda(t) = \sum_j \Lambda_j(t_1,t).

Sites with zero future recruitment exposure contribute zero to these sums. Consequently,

E[Λ(t)]=∑jwj(t1,t)hj(t1,t)αjβj,\mathbb{E}[\Lambda(t)] = \sum_j w_j(t_1,t)h_j(t_1,t)\frac{\alpha_j}{\beta_j},
Var⁡(Λ(t))=∑jwj2(t1,t)hj2(t1,t)αjβj2.\operatorname{Var}(\Lambda(t)) = \sum_j w_j^2(t_1,t)h_j^2(t_1,t)\frac{\alpha_j}{\beta_j^2}.

If E[Λ(t)]=0\mathbb{E}[\Lambda(t)] = 0, then as Λ(t)\Lambda(t) is non-negative, Λ(t)=0\Lambda(t) = 0 almost surely and consequently Y(t)=0Y(t) = 0 almost surely. Otherwise, when Var⁡(Λ(t))>0\operatorname{Var}(\Lambda(t)) > 0, the distribution of Λ(t)\Lambda(t) can be approximated by a gamma distribution with parameters (Afuture(t),Bfuture(t))(A_{\mathrm{future}}(t), B_{\mathrm{future}}(t)), where

Afuture(t)=E[Λ(t)]2Var⁡(Λ(t)),Bfuture(t)=E[Λ(t)]Var⁡(Λ(t)).A_{\mathrm{future}}(t) = \frac{\mathbb{E}[\Lambda(t)]^2}{\operatorname{Var}(\Lambda(t))}, \qquad B_{\mathrm{future}}(t) = \frac{\mathbb{E}[\Lambda(t)]}{\operatorname{Var}(\Lambda(t))}.

This gives a Poisson–gamma approximation for Y(t)Y(t). Contributions from a particular country or region can be obtained by restricting the sums to its sites. The single-screening special case also applies under site closures, with hj(t1,t)=q1j(t1,t)p1h_j(t_1,t) = q_{1j}(t_1,t)p_1.

Operational forecasting algorithm

The simulation procedure follows Anisimov and Gortzak [8]. Patient arrivals and subsequent screening outcomes are simulated, the probability of reaching the target using the current pipeline is evaluated, and admission of new patients is stopped once the probability threshold is reached. We adapt this procedure to the screening/rescreening pathway developed in the present paper. The simulation also accommodates site operating periods, including scheduled site openings and closures before the overall stopping time. If the stopping criterion is reached before a scheduled site opening, that site does not begin recruitment.

Specifically, at the end of each day ss, the trial state is updated using the number already randomised, R(s)R(s), and the numbers currently in screening and rescreening, n1(s)n_1(s) and n2(s)n_2(s). The stopping rule is then used to evaluate the conditional probability of reaching the target using only patients already in the pipeline. Admission of new patients to screening stops at time

s⋆=min⁡{s:P(W∞(s)≥R−R(s)∣Ωs)≥q}.s^\star= \min\{s : \mathbb{P}(W_\infty(s) \ge R - R(s) \mid\Omega_s) \ge q\}.

Define the minimum of an empty stopping set as infinity, so that if the stopping criterion is never reached, s⋆=∞s^\star= \infty. In forecasts with finite site recruitment windows, simulations where the probability threshold is not reached within the monitoring horizon are recorded separately and their frequency reported.

No new patients are admitted after s⋆s^\star, but those already in the screening/rescreening pipeline are allowed to complete the pathway. We obtain the predictive distribution of s⋆s^\star by Monte Carlo simulation conditional on the trial information Ωt1\Omega_{t_1}. In each replication, we first simulate the remaining outcomes and completion times for the n1(t1)n_1(t_1) patients in screening and the n2(t1)n_2(t_1) patients in rescreening at the interim time. Future daily arrivals are generated from a fitted site-level Poisson–gamma model, subject to site initiation and closure times, and each patient follows the screening pathway. At the end of each day ss, the trial state is updated and the conditional probability in the stopping rule is evaluated. The first day on which this probability reaches qq is recorded as s⋆s^\star. Repeating the procedure over MM independent replications gives the sample s1⋆,…,sM⋆s_1^\star,\ldots,s_M^\star, whose empirical distribution approximates the predictive distribution of the screening stopping time.

Illustrative simulation

Following the simulation and presentation approach of Anisimov and Gortzak [8], we present one realisation of the adaptive stopping procedure for the screening/rescreening pathway. All times and durations are expressed in days. The simulation began with 30 active sites, with 20 additional sites opening per week starting on day 7. Sites scheduled to open after adaptive stopping did not begin recruitment. In each replication, a single arrival rate for each site was drawn from Ga⁡(1.2,60)\operatorname{Ga}(1.2, 60) and retained throughout the replication. Conditional on these rates, daily arrival counts under the site operating schedule are generated as independent Poisson counts, with arrivals after adaptive stopping excluded. The screening parameters were: p1=0.75p_1 = 0.75, r=0.50r = 0.50, p2=0.70p_2 = 0.70, Δ1=14\Delta_1 = 14, D=7D = 7, Δ2=14\Delta_2 = 14.

The randomisation target was set to R=100R = 100, and admission of new patients to screening was stopped on the first day for which the conditional probability of reaching the target was at least q=0.99q = 0.99.

Screen/rescreen trial simulation with adaptive stopping, showing cumulative arrivals, cumulative randomizations, number in screening, number in rescreening, target = 100, and screen stop day

Figure 2. One simulated realisation under the adaptive stopping rule. The dashed vertical line marks the stopping day, s=123s = 123. By this time, 88 patients had been randomised, with 18 patients in initial screening and one in rescreening, giving a conditional probability of 0.9914 of reaching the target. The target was reached on day 136, and the final number of randomised patients was 105, corresponding to over-enrolment of five patients.

To examine the trade-off between under-enrolment and over-enrolment under different stopping rules, we repeated the simulation 1000 times using the same screening, rescreening and recruitment parameters. We considered probability thresholds of q=0.50q = 0.50, 0.90, 0.95, 0.99 and compared the resulting distributions of the final number of randomised patients with a baseline rule under which admission of new patients to screening stops only when the randomisation target RR is reached. All replications under each policy reached their respective stopping criteria within the 300 day monitoring horizon. The results are shown in Figure 3.

Final randomization under adaptive stopping, showing the 5th percentile, mean, and 95th percentile across stopping rules of 50%, 90%, 95%, 99%, and stop at target

Figure 3. Final number of randomised patients in simulated trials under stopping thresholds of 50%, 90%, 95% and 99%, together with the baseline rule that stops admission only when the target is reached. The points show the mean and the 5th and 95th percentiles across 1000 simulations, expressed as percentages of the target R=100R = 100. The final number includes all patients who completed screening or rescreening after admission of new patients had stopped.

Figure 3 shows that the over-enrolment distributions are relatively similar for the high thresholds of 90%, 95% and 99%, whereas over-enrolment is substantially greater under the baseline rule that waits until the target has been reached.

Combining forecasts for current and future patients

The preceding results concern two disjoint patient groups. The process X(t)X(t) denotes the number of randomisations by time tt among patients already in screening or rescreening at interim time t1t_1, whereas Y(t)Y(t) denotes the number of randomisations among patients arriving after t1t_1. Thus the total number of additional randomisations between t1t_1 and tt, denoted by Z(t)Z(t), is

Z(t)=X(t)+Y(t).Z(t) = X(t) + Y(t).

The cumulative trial total by time tt is R(t1)+Z(t)R(t_1) + Z(t). Conditional on the interim information and fixed fitted model parameters, X(t)X(t) and Y(t)Y(t) are independent under a predetermined admission schedule. Therefore the predictive distribution of Z(t)Z(t) can be obtained by convolving the distributions of X(t)X(t) and Y(t)Y(t). Evaluating this distribution over time provides forecasts of the number of randomisations by time tt, incorporating both patients observed at the interim analysis and those expected to arrive afterward.

Conclusion

This paper presents a novel statistical framework for forecasting randomisation and determining when to stop admitting new patients to screening in multicentre clinical trials with screening and rescreening, with the aim of reducing over-enrolment. We derived the distribution of future randomisations from the current screening pipeline and combined it with forecasts of new patient arrivals based on a Poisson–gamma model that accommodates future site initiations and site closures. The resulting framework enables calculation of the conditional probability of attaining the randomisation target under different scenarios. The simulation study illustrates how admission of new patients can be stopped before the target is reached while retaining a high probability of achievement. The present model assumes fixed transition probabilities and screening durations. Forecasts with closure schedules can be used to inform operational decisions via scenario planning. Future work could involve the extension of this model to include priors for the screening probabilities and durations.

Acknowledgements

The authors are grateful to Matt Austin, the Data Science Team at the Center for Design & Analysis, and the Clinical Program Operations Team at Amgen for their valuable and continuing discussions on this work.

References

  1. [1]Anisimov V. and Fedorov V., Modelling, prediction and adaptive adjustment of recruitment in multicentre trials, Statistics in Medicine, 26, 27, 2007, pp. 4958–4975.pubmed.ncbi.nlm.nih.gov/17639505
  2. [2]Anisimov V., Statistical modeling of clinical trials (recruitment and randomization), Communications in Statistics - Theory and Methods, 40, 19–20, 2011, pp. 3684–3699.DOI
  3. [3]Anisimov V., Predictive hierarchic modelling of operational characteristics in clinical trials, Communications in Statistics - Simulation and Computation, 45, iss. 05, 2016, pp. 1477–1488.
  4. [4]Anisimov V., Discussion on the paper ”Real-time prediction of clinical trial enrollment and event counts: a review” by D.F. Heitjan et al., Contemporary Clinical Trials, 46, 2016, pp. 7–10.
  5. [5]Anisimov V., Modern analytic techniques for predictive modelling of clinical trial operations, Chapter 8, in book Quantitative Methods in Pharmaceutical Research and Development: Concepts and Applications, O. Marchenko, N. Katenka (Eds), Springer International Publ., 2020, pp. 361–408.DOI
  6. [6]Anisimov V. and Austin M., Centralized statistical monitoring of clinical trial enrollment performance, Communications in Statistics: Case Studies, Data Analysis and Applications, 6, 4, 2020, pp. 392–410.DOI
  7. [7]Anisimov V., Forecasting the process of screened/randomized patients and optimal early stopping time in multicentre clinical trials, in 11th International Conference on Advances in Statistics, Bologna, Italy, 25–27 April 2025, p. 18.
  8. [8]Anisimov V. and Gortzak L., Joint forecasting of screening/randomisation processes in multicentre clinical trials and predicting optimal enrolment stopping time, in Data Analysis in the AI Era: Models, Methods and Techniques, James R. Bozeman and Christos H. Skiadas, eds., Wiley, 2026, pp. 71–97.DOI
  9. [9]Barnard K.D., Dent L. and Cook A., A systematic review of models to predict recruitment to multicentre clinical trials, BMC Medical Research Methodology, 10, 63, 2010.DOI
  10. [10]Heitjan D. F., Ge Z. and Ying G. S., Real-time prediction of clinical trial enrollment and event counts: a review, Contemporary Clinical Trials, 45, Part A, 2015, pp. 26–33.DOI
  11. [11]Senn S., Statistical Issues in Drug Development. Wiley: Chichester, 1997.

Paper details

vlnc:W_d7u7kgwf
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents