---
title: Generalized Promotion Time Cure Models
url: https://www.emergentmind.com/topics/generalized-promotion-time-cure-models-gptcms
type: topic
---

# Generalized Promotion Time Cure Models

Generalized Promotion Time Cure Models (GPTCMs) are cure-rate survival models built around a promotion-time or latent competing-risks mechanism in which the observed event time is generated by the earliest activation among an unobserved number of latent causes. In the canonical non-mixture form, if \(N\sim \mathrm{Poisson}(\theta)\), the latent activation times share cdf \(F(t)\), and \(T=\min_i Z_i\), then the population survival is \(S_{\text{pop}}(t)=\exp[-\theta F(t)]\), so that \(\lim_{t\to\infty}S_{\text{pop}}(t)=\exp(-\theta)>0\) is a cure fraction. Contemporary uses of the label GPTCM do not refer to a single unique extension: the literature uses it for biologically structured heterogeneity inside the promotion-time mechanism, transformation families containing promotion-time and mixture cure models, generalized covariate-rate formulations, flexible Bayesian and semiparametric baseline specifications, and implementations tailored to current-status, interval-censored, clustered, zero-inflated, and high-dimensional right-censored data [2408.17188, 2310.15956, 1806.01082, 2410.09892].

## 1. Promotion-time foundation and cure-model semantics

The promotion-time cure model is motivated by a latent process in which a subject retains a random number of active carcinogenic or failure-generating agents after treatment or exposure. In the classical formulation, \(N\) is Poisson, the latent times \(Z_i\) are i.i.d. with cdf \(F(t)=1-S(t)\), and the recurrence or failure time is \(T=\min\{Z_i:i=1,\dots,N\}\), with the convention that \(N=0\) implies no recurrence. This yields
\[
S_{\text{pop}}(t)=P(T>t)=e^{-\theta(1-S(t))}=e^{-\theta F(t)},
\]
and hence
\[
S_{\text{pop}}(\infty)=e^{-\theta}>0.
\]
The positive limiting survival probability is therefore generated endogenously by the latent-count mechanism rather than by a separate cured-versus-susceptible mixing weight [2408.17188, 1510.00443].

This non-mixture interpretation is central to GPTCMs. In the canonical promotion-time setting, the population hazard is proportional in the latent intensity parameter, for example \(h_p(t)=\theta f(t)\) when \(f(t)=dF(t)/dt\), and the cure fraction depends only on the latent count parameter. Several later formulations preserve this mechanism while changing the regression map, the latent promotion-time law, the observation scheme, or the dependence structure, but they retain the basic logic that cure corresponds to the event of having no effective latent causes [2305.11575].

## 2. What is generalized in a GPTCM

One line of generalization changes the biology of the latent process rather than the basic cure mechanism. In the subtype-heterogeneous construction, the total active cell count is decomposed as \(N=\sum_{l=1}^L N_l\) with \(N_l\sim \mathrm{Poisson}(\theta_l)\), \(p_l=\theta_l/\theta\), and subtype-specific promotion-time survivals \(S_l(t)\). The resulting population survival is
\[
S_{\text{pop}}(t)=\exp\!\left\{-\theta\left(1-\sum_{l=1}^L p_l S_l(t)\right)\right\},
\]
equivalently \(S_{\text{pop}}(t)=e^{-\theta F(t)}\) with \(F(t)=\sum_{l=1}^L p_lF_l(t)\). Standard PTCM is recovered when all \(S_l(t)\) are identical. Here the generalization is a mixture of subtype-specific promotion-time survivals *inside* the exponential survival generator, intended to represent intratumor or intra-sample heterogeneity rather than a population mixture of latent classes [2408.17188].

A second line of generalization is transformation-based. The Box-Cox transformation cure model defines
\[
G(S_p(y),\alpha)=-\pi(\alpha)\bigl(1-S(y)\bigr),
\]
with \(\alpha=0\) yielding the promotion-time cure model and \(\alpha=1\) yielding the mixture cure model. In this sense, promotion-time cure becomes one endpoint of a broader transformation family, and intermediate \(0<\alpha<1\) values interpolate between the two regimes [2310.15956].

A third line generalizes the regression-side rate function. The model
\[
S(t\mid x)=\exp\!\left(-g(\gamma,x)\,\theta\,F(t)\right)
\]
replaces the classical one-index form by a user-chosen positive covariate map \(g(\gamma,x)\) and a separate scalar \(\theta\). This preserves the promotion-time interpretation while moving the baseline object from a normalized cdf to \(\Lambda(t)=\theta F(t)\), which eliminates the Lagrange-multiplier constraint that complicates classical nonparametric maximum likelihood estimation [1806.01082].

A fourth line generalizes the family of promotion-time laws under a common Bayesian engine. The R package `"bayesCureRateModel"` presents a GPTCM family indexed by \((\gamma,\lambda)\) and a promotion-time law \(F(\cdot;\boldsymbol\alpha)\), with built-in exponential, Gompertz, log-logistic, Weibull, Gamma, Lomax, Dagum, finite mixtures of gamma distributions, and user-defined proper distributions. In that family, \(\gamma\to0\) with \(\lambda=1\) yields the promotion-time cure model, \(\gamma>0,\lambda=1\) the negative binomial cure model, and \(\gamma=-1,\lambda=1\) the mixture cure model; the case of no cured subjects is represented at \((\gamma,\lambda,\vartheta)=(-1,1,e)\) rather than as a boundary case [2409.10221].

Not every use of “generalized” introduces a new abstract family. For current-status data, one Bayesian promotion-time paper explicitly states that its generalized aspect is not a new GPTCM class in the abstract sense, but rather the use of a more general, flexible baseline \(F(t)\) under Bayesian estimation. In GPTCM terms, that contribution is best viewed as a Bayesian current-status implementation of the promotion-time member of the broader biological cure-model class [2410.09892].

## 3. Regression structure, cure probability, and hazard interpretation

In the canonical promotion-time regression form, covariates enter through a log-link on the promotion intensity:
\[
S_{\text{pop}}(t\mid X)=\exp\!\left[-e^{\boldsymbol\theta'X}F(t)\right],
\qquad
p(X)=\lim_{t\to\infty}S_{\text{pop}}(t\mid X)=\exp\!\left[-e^{\boldsymbol\theta'X}\right].
\]
This structure couples incidence and latency: the same regression term controls both the long-run cure fraction and the event-time behavior among susceptibles. In that respect, the cure rate is not a separate mixing weight, unlike a standard mixture cure model [2410.09892].

Some GPTCMs allow covariates to affect both the latent promotion count and the latent promotion-time distribution through different linear predictors. In the Bayesian P-spline formulation,
\[
\theta(\mathbf{x})=\exp(\beta_0+\mathbf{x}^T\beta),
\qquad
F(t\mid\mathbf{z})=1-S_0(t)^{\exp(\mathbf{z}^T\gamma)},
\]
so that
\[
S_p(t\mid \mathbf{x},\mathbf{z})
=
\exp\!\left[
-\exp(\beta_0+\mathbf{x}^T\beta)
\left(1-S_0(t)^{\exp(\mathbf{z}^T\gamma)}\right)
\right].
\]
Because \(\mathbf{z}\) enters the latent distribution, the population hazard ratio is generally time-varying even though the latent susceptible model is Cox proportional hazards [1312.2369].

Other formulations generalize the predictor itself. In the Deep Promotion Time Cure Model, the classical linear index \(\mathbf{w}^\top\mathbf{x}+b\) is replaced by a learned function \(\eta(\mathbf{x})\), giving
\[
\theta(\mathbf{x})=\exp(\eta(\mathbf{x})),
\qquad
S_p(t;\mathbf{x})=\exp\!\left(-\exp(\eta(\mathbf{x}))F(t)\right),
\qquad
\pi(\mathbf{x})=\exp\!\left(-\exp(\eta(\mathbf{x}))\right).
\]
The model therefore preserves the cure interpretation while allowing nonlinear and interaction effects in high-dimensional covariates [2305.11575].

In clustered marginal promotion-time cure modeling, the same exponential-rate structure is retained subjectwise:
\[
S(t;\mathbf X_{ij})=\exp\!\left\{-e^{\beta^T\mathbf X_{ij}}F_{\mathfrak p}(t)\right\},
\qquad
P(Y_{ij}=0\mid \mathbf X_{ij})=\exp\{-e^{\beta^T\mathbf X_{ij}}\}.
\]
This supports two equivalent interpretations of \(\beta\): as log hazard-ratio effects on the overall survival distribution and as effects on cure probability through \(\log\{-\log P(\text{cured}\mid X)\}=\beta^TX\) [2505.09247].

## 4. Observation schemes and likelihood construction

For ordinary right-censored data \((y_i,\delta_i,\mathbf x_i)\), GPTCM likelihoods usually retain the survival-density factorization
\[
L(\boldsymbol\theta;\boldsymbol y,\boldsymbol x)
=
\prod_{i=1}^{n}
f_P(y_i;\boldsymbol\theta,\boldsymbol x_i)^{\delta_i}
S_P(y_i;\boldsymbol\theta,\boldsymbol x_i)^{1-\delta_i},
\]
often with latent cure indicators \(I_i\) introduced to form a complete-data likelihood and simplify posterior or EM-based computation. In the generalized Bayesian family implemented in `"bayesCureRateModel"`, this latent-variable augmentation supports Gibbs updates for \(I_i\) and model-based computation of subject-specific cured probabilities \(P(I_i=0\mid \boldsymbol y,\boldsymbol x)\) [2409.10221].

Current-status data change the problem fundamentally. Each subject is observed only once at a monitoring time \(U_i\), with
\[
\delta_i=I(T_i\le U_i),\qquad
\mathscr D=\{(U_i,\delta_i,X_i):i=1,\dots,n\}.
\]
Under independent non-informative current-status censoring, the likelihood becomes
\[
L(\boldsymbol\theta,F(\cdot)\mid \mathscr D)
=
\prod_{i=1}^n
S_{\text{pop}}(U_i\mid X_i)^{1-\delta_i}
\left[1-S_{\text{pop}}(U_i\mid X_i)\right]^{\delta_i},
\]
so the data inform the model only through whether the event has occurred by the examination time, not through the actual event time. The paper explicitly treats this as type-I interval censoring and discretizes the baseline on the observed monitoring times by a step-function representation \(F_s(t)\) parameterized through step increments \(\eta_l\) [2410.09892].

Interval-censored GPTCMs use yet another likelihood geometry. For observed data \(\mathcal D_O=\{(l_i,r_i,\delta_i,\mathbf x_i,\mathbf z_i)\}\), the semi-parametric transformation-cure likelihood is written
\[
l(\boldsymbol\theta\mid \mathcal D_O)
=
\sum_{i\in\Delta_1}\log\{S_p(l_i)-S_p(r_i)\}
+
\sum_{i\in\Delta_0}\log\{S_p(l_i)\},
\]
with latent susceptibility indicators introduced only for right-censored subjects in the EM algorithm [2310.15956].

Some applications require exact mass at time zero. The zero-inflated promotion cure rate model adds a third class beyond susceptibles and cured subjects:
\[
S(t)=\gamma_1+(1-\gamma_0-\gamma_1)S_p^*(t),
\]
where \(\gamma_0\) is the zero-inflated mass, \(\gamma_1\) the cure fraction, and \(S_p^*(t)\) the promotion-model susceptible survival. In that setting, the likelihood distinguishes exact zeros, uncensored positive times, and right-censored times, producing a three-way mixture tailored to immediate-failure phenomena such as bank-loan fraud [1510.00443].

## 5. Estimation paradigms and computational strategies

Bayesian computation has become a major route for GPTCM fitting. In the current-status promotion-time model, priors are placed independently on the regression vector and the step-function baseline parameters, and posterior computation uses an adaptive Metropolis-Hastings algorithm because the full conditionals are not of closed form. The algorithm starts by maximizing the posterior to obtain initial values, uses a Gaussian random-walk proposal with covariance based on the inverse observed Fisher information at the current mode, later updates that covariance adaptively, and summarizes posterior inference through posterior means under squared-error loss. The same paper uses LPML via CPO, DIC, and scaled CPO plots for model assessment [2410.09892].

The generalized Bayesian family in `"bayesCureRateModel"` employs a Metropolis-coupled Markov chain Monte Carlo sampler embedded in a parallel tempering / MC\(^3\) scheme. Its inference engine combines Gibbs sampling for latent cure indicators with either componentwise Metropolis-within-Gibbs log-normal proposals or MALA updates whose gradient is computed numerically. Because the posterior can be multimodal, the authors prefer MAP estimation over posterior means and use heated posteriors to improve exploration of separated modes; the package also supports prediction of survival, cumulative hazard, hazard, conditional cure probability, Cox–Snell residuals, and FDR-based identification of cured subjects [2409.10221].

Semiparametric likelihood theory provides a different computational solution. The extension \(\mathcal P_3\) rewrites the model in terms of \(\Lambda(t)=\theta F(t)\), yielding a nuisance maximizer with explicit closed form for each fixed \(\gamma\). The profile objective then resembles Cox-model estimation, and the paper derives consistency, asymptotic normality, weak convergence of \(\widehat\Lambda\), and closed-form asymptotic variances for \(\widehat\gamma\), \(\widehat\theta\), and \(\widehat p(x)\). This is the main sense in which the model is “closer in spirit to the Cox model” than the classical promotion-time cure model [1806.01082].

Several semiparametric and Bayesian extensions focus on flexible baseline or covariate effects. Bayesian P-spline estimation models the latent baseline hazard as
\[
h_0(t)=\exp\!\left(\sum_{k=1}^K b_k(t)\phi_k\right),
\]
places a difference-penalized Gaussian prior on spline coefficients, and uses MCMC with adaptive Metropolis updates for regression and spline parameters and Gibbs updates for smoothing hyperparameters. Local-polynomial estimation in the Yakovlev model instead treats \(\theta(X)=\exp(m(X))\) with \(m(\cdot)\) unknown, derives a strictly concave local likelihood for fixed baseline parameter \(\gamma\), and proves that the nonparametric component has the usual local-polynomial bias \(O(h^{p+1})\) and variance \(O((nh)^{-1})\), while \(\hat\gamma\) remains root-\(n\) consistent under undersmoothing conditions [1312.2369, 1911.00741].

Deep-learning and correlated-data methods extend GPTCM computation into large-scale and dependent settings. Deep-PTCM trains the cure model end-to-end by backpropagation, jointly optimizing the neural predictor and a piecewise exponential \(F\), and optionally decomposes the predictor into orthogonalized linear and nonlinear parts for interpretability. For clustered right-censored data, the semiparametric marginal promotion-time model estimates regression effects by generalized estimating equations or quadratic inference functions, with QIF shown to be optimal within the stated class of estimating equations and to have smaller asymptotic variance than GEE [2305.11575, 2505.09247].

## 6. Applications, interpretation, and recurring methodological issues

GPTCMs have been used for epidemiological studies, destructive testing, oncology, smoking cessation, marriage duration, mortgage default, kidney transplant survival, periodontal disease, and bank-loan fraud. Recent examples include lung-tumor and breast-cancer current-status analyses, where cure-model interpretation was motivated by a long survival plateau and cure rates varied with environment, tumor stage, grade, nodal status, and cathepsin-D status; a first-marriage duration analysis implemented in `"bayesCureRateModel"`; a large US mortgage-loan study in which Deep-PTCM improved discrimination and calibration; a smoking-cessation interval-censoring study in which the fitted Box-Cox parameter selected the mixture-cure endpoint; a breast-cancer semiparametric analysis with nonlinear link functions; a melanoma trial in which treatment acted more strongly on the cure component than on latent incubation time; and a periodontal application in which QIF produced the smallest standard errors and revealed effects of mobility, attachment loss, filled teeth, and bleeding on probing [2410.09892, 2409.10221, 2305.11575, 2310.15956, 1806.01082, 1312.2369, 2505.09247].

A persistent misconception is to equate GPTCMs with ordinary finite-mixture survival models. The subtype-heterogeneous formulation explicitly contrasts its structure with the naive model \(P(N=0)+\sum_{l=1}^L p_lS_l(t)\) and argues that this is not biologically meaningful for recurrence, because recurrence is caused by the combined latent propagation of multiple cells rather than by a sample being “from one subtype only.” Likewise, in the standard promotion-time regression form the cure probability is typically \(\exp[-e^{\eta(X)}]\), not a separate logistic or multinomial mixing weight, although exact-zero extensions deliberately add such a component when the application requires a point mass at time zero [2408.17188, 1510.00443].

Methodological difficulties recur across the literature. Identifiability may require at least one continuous covariate with non-negligible effect on the promotion-rate parameter in the generalized Bayesian family, insufficient follow-up can make simultaneous cure-side and latency-side covariate effects hard to disentangle in the Bayesian P-spline model, threshold-based cure classification introduces sensitivity in local-polynomial Yakovlev estimation, and the Box-Cox parameter \(\alpha\) can be difficult to estimate precisely because the likelihood is flat in the \(\alpha\)-direction for intermediate values. Posterior multimodality is another practical issue, motivating parallel tempering and MAP-based summaries in some Bayesian GPTCMs. A plausible implication is that “GPTCM” is best understood not as a single fixed model but as a family of non-mixture cure formulations that preserve the promotion-time latent-cause interpretation while varying the latent distribution, regression architecture, censoring regime, and inferential machinery [2409.10221, 1312.2369, 1911.00741, 2310.15956].

Source: https://www.emergentmind.com/topics/generalized-promotion-time-cure-models-gptcms