Next Article in Journal
BRAF Inhibition and UVB Light Synergistically Promote Mus musculus Papillomavirus 1-Induced Skin Tumorigenesis
Previous Article in Journal
Ferroptosis in Renal Cancer Therapy: A Narrative Review of Drug Candidates
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

MCMC Methods for Parameter Estimation in ODE Systems for CAR-T Cell Cancer Therapy

by
Elia Antonini
1,*,
Gang Mu
1,
Sara Sansaloni-Pastor
2,
Vishal Varma
3 and
Ryme Kabak
3
1
Cilag GmbH International, 6300 Zug, Switzerland
2
Actelion Pharmaceuticals Ltd., 4123 Allschwil, Switzerland
3
Johnson & Johnson World Headqtrs US, Bridgewater, NJ 08807, USA
*
Author to whom correspondence should be addressed.
Cancers 2024, 16(18), 3132; https://doi.org/10.3390/cancers16183132
Submission received: 24 July 2024 / Revised: 6 September 2024 / Accepted: 9 September 2024 / Published: 11 September 2024
(This article belongs to the Section Cancer Immunology and Immunotherapy)

Abstract

:

Simple Summary

Chimeric antigen receptor (CAR)-T cell therapy is a promising treatment for highly resistant blood cancers, using genetically modified T cells from the patient or a donor. While CAR-T therapy has been successful in pre-clinical and clinical stages for cancer treatment, it also presents challenges, including cytokine release syndrome. To improve the efficacy and reduce side effects, there is a need to better understand CAR-T cell behavior. We aimed to develop a mathematical framework that describes CAR-T behavior using ordinary differential equations (ODEs) and Bayesian parameter estimation (using advanced algorithms including Metropolis–Hastings, DEMetropolis, and DEMetropolisZ). This model will help to understand CAR-T behavior and, by extension, help to improve the effectiveness and efficacy of therapy in a clinical setting.

Abstract

Chimeric antigen receptor (CAR)-T cell therapy represents a breakthrough in treating resistant hematologic cancers. It is based on genetically modifying T cells transferred from the patient or a donor. Although its implementation has increased over the last few years, CAR-T has many challenges to be addressed, for instance, the associated severe toxicities, such as cytokine release syndrome. To model CAR-T cell dynamics, focusing on their proliferation and cytotoxic activity, we developed a mathematical framework using ordinary differential equations (ODEs) with Bayesian parameter estimation. Bayesian statistics were used to estimate model parameters through Monte Carlo integration, Bayesian inference, and Markov chain Monte Carlo (MCMC) methods. This paper explores MCMC methods, including the Metropolis–Hastings algorithm and DEMetropolis and DEMetropolisZ algorithms, which integrate differential evolution to enhance convergence rates. The theoretical findings and algorithms were validated using Python and Jupyter Notebooks. A real medical dataset of CAR-T cell therapy was analyzed, employing optimization algorithms to fit the mathematical model to the data, with the PyMC library facilitating Bayesian analysis. The results demonstrated that our model accurately captured the key dynamics of CAR-T cell therapy. This conclusion underscores the potential of parameter estimation to improve the understanding and effectiveness of CAR-T cell therapy in clinical settings.

1. Introduction

CAR-T is based on the genetic modification of T cells (from the patient or a donor) to recognize antigens present on the targeted tumor cell’s surface [1]. Over the years, a new generation of CAR constructs have incorporated co-stimulatory domains, to increase their anti-tumor activity [2].
CAR-T therapy has become a lifesaving treatment for many oncology patients. The results from different studies show that the ORR (overall response rate) is 44–91% and CR (complete remission) rates are 28–68% [3]. However, CAR-T cells are associated with acute severe events, such as CRS, aplasia, cytopenias, and infections, among others. Therefore, there is a medical need to better understand the complex mechanisms behind these events.
The effectiveness of CAR-T cell therapy largely depends on the patient’s T cell quality (cell proliferation, life time, and anti-tumor activity). Therefore, a key goal for better outcomes is to prevent or delay the T cells from becoming exhausted ( C E ), while keeping their memory properties ( C M ). Exhausted CAR-T cells are a limitation to the therapy efficiency and are defined as inhibition of the T cell proliferation and effector function. This exhaustion happens due to different factors, such as persistent antigen stimulation, the immunosuppressive tumor environment [4], and in vitro growing system [5], and it leads to resistance and relapse in patients. Currently, different strategies are being studied to overcome exhaustion in CAR-T cell therapy. For instance, immune checkpoint blockade (PD-1) [6,7] or/and TGF- β [8], deletion of Cbl-b [9], modulation of CAR surface expression [10], and uncoupling of antigen recognition [11]. Furthermore, studies with patients have suggested that having more memory-like T cells leads to a more efficient treatment, meaning CAR-T cells work for longer, with a slower disease progression and longer remission periods for patients. Therefore, analyzing the different types of T cells in the final treatment product and in patient samples after treatment could help to better understand how different immune characteristics can make CAR-T cell therapy more effective. Figure 1 describes the interactions between the CAR-T phenotypes and tumor cells (T).
In recent years, various ordinary differential equation (ODE) models have been developed to understand the dynamics of CAR-T cell kinetics and their interactions with cancer cells. A range of studies have reviewed the CAR-T structure, pharmacological properties, and modeling approaches, highlighting unique challenges due to CAR-T cells’ live nature and their atypical kinetic profiles compared to traditional drugs [12,13,14,15,16]. Among these models, the ODE model from [17] was selected for its ability to capture the kinetics of CAR-T cells, including antigen-dependent expansion, phenotypic heterogeneity, and the influences of the tumor. This model uniquely integrates functional, memory, and exhausted CAR-T cell phenotypes with cancer cell dynamics, providing a comprehensive description of CAR-T immunotherapy’s effectiveness in patients with hematological cancers. By fitting this model to clinical data, this allows for the identification of key kinetic parameters and phenotypic dynamics that correlate with long-term therapy outcomes.
Figure 1. Different CAR-T cell phenotypes and their effect on patients, every dynamic is labeled with the kinetic parameters from Table 1 and Table 2. After CAR-T cell infusion, they spread throughout the body ( C D ), with some settling in blood and tumor areas. These engrafted cells are known as effector. CAR-T cells ( C T ), they expand upon antigen contact (,) and differentiate into memory CAR-T cells ( C M ), before becoming exhausted and either dying naturally or through a tumor immunosuppressive mechanism. Both effector CAR-T cells and those that are rapidly spreading can kill cancer cells. The memory CAR-T cells eventually die off, yet they can quickly react to cancer cells. When these memory cells come into contact with cancer cells, they turn back into effector CAR-T cells and quickly help to fight the cancer. However, over time, these cells can become worn out and stop working. The cancer cells (T), which are recognized by the CAR-T cells, grow based on what they have available in their environment and are killed off by the cytotoxic effect of the working CAR-T cells (). The net growth in cancer cells is determined by how fast they multiply and naturally they die, represented by the logistic function () [17].
Figure 1. Different CAR-T cell phenotypes and their effect on patients, every dynamic is labeled with the kinetic parameters from Table 1 and Table 2. After CAR-T cell infusion, they spread throughout the body ( C D ), with some settling in blood and tumor areas. These engrafted cells are known as effector. CAR-T cells ( C T ), they expand upon antigen contact (,) and differentiate into memory CAR-T cells ( C M ), before becoming exhausted and either dying naturally or through a tumor immunosuppressive mechanism. Both effector CAR-T cells and those that are rapidly spreading can kill cancer cells. The memory CAR-T cells eventually die off, yet they can quickly react to cancer cells. When these memory cells come into contact with cancer cells, they turn back into effector CAR-T cells and quickly help to fight the cancer. However, over time, these cells can become worn out and stop working. The cancer cells (T), which are recognized by the CAR-T cells, grow based on what they have available in their environment and are killed off by the cytotoxic effect of the working CAR-T cells (). The net growth in cancer cells is determined by how fast they multiply and naturally they die, represented by the logistic function () [17].
Cancers 16 03132 g001
An important tool used in this paper are Markov chains [18], which form the basis of many stochastic models in this study. This serves as a foundation for developing advanced Markov models and Monte Carlo simulation techniques, which are crucial for capturing the probabilistic nature of biological interactions and treatment responses.
Furthermore, this paper delves into Bayesian statistics to estimate the parameters of our mathematical model. Techniques such as Monte Carlo integration [19], Bayesian inference, and Markov chain Monte Carlo (MCMC) methods are employed to assess the uncertainty in parameter estimates and enhance the model’s predictive capabilities. Recent advancements in Bayesian methods have provided powerful tools for biological parameter estimation [20,21], particularly in ODE models, such as that of Keersmaekers et al. for modeling the B- and T-cell dynamics induced by Varicella-Zoster virus vaccines [22], or in the novel approach presented by Dang et al., where conditional neural ODE processes are utilized for forecasting individual disease progression, as demonstrated in a case study on COVID-19 [23].
MCMC methods, in particular, are crucial to the understanding and implementation of Bayesian parameter estimation within our context. This paper provides an in-depth examination of several MCMC techniques, including the standard Metropolis–Hastings algorithm. Additionally, we explore advanced methods like the DEMetropolis [24] and DEMetropolisZ algorithms [25], which integrate differential evolution [26] with the classical Metropolis–Hastings method, to enhance convergence rates. Recent research by Valderrama-Bahamóndez et al. demonstrated the applicability of these methods to ODE biological models, further validating their use in our analysis [27].
The theoretical findings and algorithms proposed in this paper were substantiated through a numerical application using Python, with Jupyter Notebooks serving as the computational platform. A real medical dataset [15] of CAR-T cell therapy was analyzed, and various optimization algorithms were employed to fit the mathematical model to the data. The PyMC library [28] was utilized to construct MCMC samplers, facilitating the Bayesian analysis.
This paper aimed to not only study the dynamics of CAR-T cell interactions within a patient’s body but also to explore the frontier of mathematical methodologies that can be used in medical research to create a patient-specific treatment [17].

2. Methods

The parameters were extracted from the mathematical model of A. Paixao. et al. [17]. Different phenotypes of CAR-T cells were considered:
  • Distributed functional CAR-T cell ( C D );
  • Effector functional CAR-T cell ( C T );
  • Memory CAR-T cell ( C M );
  • Exhausted CAR-T cell ( C E ).
In the monitoring phase, only the total number of CAR-T cells (C) can be measured
C = C D + C T + C M + C E .

2.1. Math Model Description

The model from [17] describes CAR-T cell immunotherapy in blood cancer patients, including distributed C D and functional C T , memory C M , and exhausted CAR-T cells C E .
d C D d t = ( β + η ) C D ,
d C T d t = η C D + k ( t ) F ( T ) C T ( ξ + ϵ + λ ) C T + θ T C M α T C T ,
d C M d t = ϵ C T θ T C M μ C M ,
d C E d t = λ C T δ C E ,
d T d t = r T ( 1 b T ) γ f ( C F , T ) T ,
in which the total number of functional CAR-T cells is
C F = C D + C T ,
and the functions k ( t ) , F ( T ) , and f ( C F , T ) are given by
k ( t ) = r m i n + p 1 1 + ( p 2 t ) p 3 ,
F ( T ) = T A + T ,
f ( C F , T ) = C F T ϑ + a + C F T .
k ( t ) F ( T ) is the antigen-specific expansion rate of the effector cells,
  • The expansion function F ( T ) describes the growth of effector CAR-T cells, which only happens in the presence of an antigen and is capped by the cells’ inherent growth potential. This is captured in the relation
    0 T A + T 1 .
  • The term k ( t ) influences the antigen-dependent growth of CAR-T cells.
This model represents the interaction mechanisms provided in Figure 1.

2.2. Parameters of the ODE System

The model parameters, its units, and their biological meaning are displayed in Table 1 and Table 2. These tables from the article [17] are included here to facilitate readability and a clearer understanding of the model dynamics.
The kinetic parameters are crucial figures in the study of biological and chemical processes. They describe the rates at which reactions occur, providing insights into how drugs are absorbed, distributed, metabolized, and eliminated from the system, helping to determine an appropriate dosage.
In this article, we analyzed these kinetic parameters, which are crucial for understanding how different treatments affect patients. The distinction between Table 1 and Table 2 indicates that, while some of these parameters vary from patient to patient, others remain constant across the board, as can be found in the literature [14,17,29] (for more details see Section 3.1). The aim of this article was to provide an estimation of the 13 kinetic parameters that are patient-dependent (Table 2).
Traditionally, researchers estimate these parameters using a Frequentist approach [17]. However, our study proposes a shift towards a Bayesian methodology, specifically employing Markov chain Monte Carlo (MCMC) methods like Metropolis–Hastings. This choice is driven by the complex nature of biological systems, where individual variability plays a significant role and the data for each patient are not extensive.
A Bayesian approach, in contrast to the frequentist method, allows us to incorporate prior knowledge and uncertainty into our estimates. This is particularly advantageous in the fields of biology and medicine, where it enables a better understanding of underlying processes. By better capturing the variability inherent in biological systems, we can tailor treatments more precisely to individual patients.
This shift towards personalized medicine, facilitated by Bayesian methods, represents a significant advancement. By acknowledging and accounting for individual differences, we can develop more effective and specific treatment plans. This not only improves the efficacy of interventions, but also potentially reduces the risk of adverse effects.

2.3. Analyses of the ODEs’ Biological Meaning

This model presumes that, following their administration, CAR-T cells are evenly distributed within a patient’s body, leading to a uniform interaction with tumor cells throughout the system.
In Equation (2), where distributed CAR-T cells ( C D ) are described, the terms are represented by the following biological interactions:
  • C D have a built-in death rate, denoted by β C D , reflecting the natural death of these cells over time;
  • C D have a rate at which they successfully take hold, or engraft, symbolized by η C D , which indicates their ability to persist in the patient’s body and begin their therapeutic function.
Then, we obtain the equation C D ( t ) = C D ( 0 ) e ( β + η ) t , which describes how the number of CAR-T cells changes over time, where C D ( 0 ) is the initial number of cells introduced into the body, the initial dose. This equation captures the net effect of the simultaneous processes of cell death and engraftment. Moreover, we can suppose that
[ C T ( 0 ) , C M ( 0 ) , C E ( 0 ) ] = [ 0 , 0 , 0 ] ,
Since when the infusion starts, all the CAR-T cells are “distributed” and have not yet transitioned into other functional states.
In Equation (3), concerning Effector CAR-T Cells ( C T ) , we can observe the following dynamics:
  • C T cells increase by a factor η C D due to the transition of distributed cells into active, effector cells;
  • We previously discussed the k ( t ) F ( T ) C T term, which modulates the interaction between effector cells and tumor cells;
  • C T cells decrease over time due to a natural dying-off process at a rate represented by ξ C T , which models the finite lifespan of these cells in the body;
  • C T cells can transform into memory CAR-T cells at a rate of ϵ C T , contributing to the persistence of therapeutic activity even after effector cells decrease;
  • C T cells gradually lose their growth and cancer-fighting abilities, transitioning into exhausted cells at a rate λ C T , which reflects the eventual decrease in their functional capacity;
  • The C T population is also reinforced by the transformation into memory CAR-T cells, due to ongoing contact with tumor cells. This is represented by the term θ T C M , indicating that memory cells can be reactivated under certain conditions;
  • Furthermore, tumor cells have various ways to suppress effector CAR-T cells, one of which is described by the term α T C T , highlighting the immune-evasive properties of the tumor.
In Equation (4), where the behavior of Memory CAR-T Cells ( C M ) is characterized, we can see the following interactions:
  • C M cells increase by a factor ϵ C T due to the conversion from effector cells, providing a reservoir of cells that can potentially re-engage in fighting cancer;
  • The C M population decreases by a factor θ T C M , accounting for their transformation back into effector CAR-T cells upon contact with tumor cells, thus maintaining a balance between different CAR-T cell states;
  • Finally, C M cells decrease due to their eventual natural death at a rate μ C M .
Memory CAR-T cells generally live longer than active CAR-T cells, hence μ < ξ . It is important to note that the memory form of CAR-T discussed here does not have direct cancer-killing properties. The creation of the memory CAR-T cell pool primarily occurs during the phase where active CAR-T cells decrease in number, serving as a potential backup for future immune responses.
Moving to Equation (5), we see the exhausted CAR-T cell ( C E ) population described, where the following terms are observed:
  • C E cells increase by a factor λ C T , as effector cells gradually lose their growth and cancer-fighting abilities, transitioning into a less functional state;
  • The natural death of these exhausted cells is accounted for by the term δ C E , representing their eventual elimination from the body.
Finally, in Equation (6), the tumor cells ( T ) are assumed to grow according to a logistic model with a growth rate r and a carrying capacity of 1 / b , represented by
r T ( 1 b T ) .
Moreover, the effectiveness of functional CAR-T cells in eliminating tumor cells is given by γ f ( C F , T ) . The function f ( C F , T ) indicates the degree of interaction between CAR-T cells and tumor cells, with a saturation point when T C F , reflecting a scenario where the tumor burden exceeds the CAR-T cell capacity. If T C F , the tumor cell killing rate is approximately γ , implying near-optimal efficacy. The term θ T defines the cell number where the function reaches half its maximum effect, representing a non-linear relationship between CAR-T cell activity and the tumor.
Details of the technical analysis regarding the existence and uniqueness of solutions are provided in Supplementary Material S1.

2.4. MCMC Methods

Markov chain Monte Carlo (MCMC) methods are powerful tools for parameter estimation and used in our Bayesian framework. These methods work by generating samples from a probability distribution based on a defined model and the observed data. The idea is to construct a Markov chain, a sequence of random samples, that has the desired distribution as its equilibrium distribution. Over time, the distribution of these samples converges to the true posterior distribution of the parameters, allowing for accurate estimation, even in complex models.
The core advantage of MCMC methods lies in their ability to incorporate prior knowledge about the parameters into the estimation process. Unlike frequentist methods, which focus solely on maximizing the likelihood function to find “best fit” parameters, Bayesian methods—facilitated by MCMC—integrate both likelihood and prior information. This is particularly beneficial in situations where data are sparse or noisy.
In the context of CAR-T therapy, where patient measurements are often limited due to the invasive and costly nature of the treatment, MCMC methods are a useful tool. The ability to include prior biological knowledge or expert opinion about the expected behavior of the therapy as priors can significantly improve the robustness of the parameter estimates. This is crucial in such settings, because frequentist methods, which rely solely on the available data, may produce a “best solution” that is not accurate when data are sparse. The Bayesian approach, by contrast, allows for more informed and credible inferences about the parameters, leading to better decision-making in clinical contexts.
Next, we will focus on Metropolis–Hastings variants mixed with a differential evolution (DE) approach. For detailed background information on these methods, please refer to the Supplementary Materials S2–S5.

2.4.1. DEMetropolis Algorithm

The DEMetropolis algorithm is a powerful hybrid method that combines the principles of differential evolution (DE) with the Metropolis–Hastings criterion. This algorithm generates new candidate solutions by mutating differences between randomly selected parameter chains, allowing for efficient exploration of the parameter space. Based on extensive evaluation criteria, including the speed of convergence and the minimization of bias between actual and simulated data, we determined that a combination of Metropolis–Hastings and DE is optimal for our analysis.
As shown in Supplementary Material S5, the differential evolution (DE) algorithm is a genetic algorithm used for global optimization problems. The DEMetropolis algorithm, derived from DE and integrated with the Metropolis–Hastings criterion (Supplementary Material S3), generates new candidate vectors by mutating the difference between randomly selected chains. The method, described in [24], uses a single tuning factor, where the acceptance of these new candidates is governed by the Metropolis–Hastings rule, ensuring that the algorithm not only converges quickly but also maintains a balance between exploration and exploitation, making it highly effective for complex stochastic models.

2.4.2. DEMetropolisZ Algorithm

The DEMetropolisZ algorithm represents another step further in parameter estimation accuracy. The method builds upon the DEMetropolis framework by incorporating a unique strategy, the use of information from the previous jumps, in its sampling approach. The modification of the sampling approach modifies the trajectory to be in parallel with the line θ a θ b and is thus designated as a parallel direction update. By utilizing parallel direction sampling [30,31], we adopt Gibbs sampling in this specific direction, an approach that enables local movement. Each update spans a dimension of at least min ( d , N 1 ) . Consequently, the sampling strategy must address a space greater than dimension d to be effective.
To bypass the condition that N > d , it is possible to use difference vectors from prior updates to improve the chains. Integrating this strategy converts the standard DEMetropolis into an adaptive MCMC process [32,33]. To ensure consistency in converging to the posterior distribution, the updates must gradually decrease in magnitude over time [34]. This objective is achievable by uniformly sampling the difference vectors at random, potentially from a version of the historical data that have undergone thinning. The practice of thinning offers several benefits, not least of which is a reduction in the demands on data storage.

2.5. PyMC Model

Now, we can specify the PyMC [28] model for the MCMC algorithms. We used a normal likelihood on untransformed data (i.e., not log transformed) to best fit the peaks of the data:
L ( θ | x ) = 1 2 π σ 2 exp ( x μ ) 2 2 σ 2 .
Here, x represents the actual data points, and μ represents the simulated ODE predictions. The term ( x μ ) denotes the error between the actual data and the simulated predictions.
The priors are represented by truncated normal distributions, defined as
p ( θ ) = ϕ ( θ ; μ , σ ) Φ ( b ; μ , σ ) Φ ( a ; μ , σ )
for θ in the interval [ a , b ] , where ϕ ( θ ; μ , σ ) is the probability density function of the normal distribution with mean μ (the value obtained from least square) and standard deviation σ (chosen specifically for each parameter), and Φ ( · ; μ , σ ) is the cumulative distribution function of the normal, evaluating the accumulated probability up to the specified point. Here, a = 0 and b = + are the lower and upper limits of truncation, respectively. The lower bound is set to ensure that all parameters are positive for biological reasons, which also guarantees the existence of the ODE solution.

3. Results

We analyzed the practical aspects of parameter estimation; our focused was to bridge the theoretical foundations with tangible, computational demonstrations, using a suite of algorithms implemented in Python. This approach was facilitated by the use of PyMC [28], a powerful library from Python for probabilistic programming, which enabled us to conduct sophisticated Bayesian inference. The code was run on Oracle VM VirtualBox, a virtual machine for Linux, that allowed us to create more chains in parallel.
We explored four distinct algorithms within the PyMC framework:
  • Metropolis—standard Metropolis–Hastings;
  • DEMetropolis—a differential evolution Metropolis;
  • DEMetropolisZ—a differential evolution Metropolis sampler that uses the past to inform sampling jumps;
  • SMC—sequential Monte Carlo.
All of them offer unique advantages for parameter estimation, as shown in Table 3.
These algorithms were chosen for their relevance and efficiency in handling complex statistical problems, providing a comprehensive overview of current methodologies in Bayesian inference.
We compared the performance of these Bayesian algorithms against the classical least squares method using scipy.optimize.least_squares [35], a staple in statistical modeling for parameter estimation. Through the careful examination of these algorithms and their applications, we present a pathway for innovative research directions and the advancement of statistical methodologies in the mathematical sciences.

3.1. Setting for CAR-T Cell Therapy

We remind that the model [17] consists of the ODE systems (2)–(9). Moreover, we recall that the state vector [ C D ( t ) , C T ( t ) , C M ( t ) , C E ( t ) ] indicates the population of the Car-T phenotypes, respectively:
  • Distribution ( C D );
  • Effector ( C T );
  • Memory ( C M );
  • Exhausted ( C E ).
T ( t ) is the population of the tumor cells.
The initial conditions of the states are
C D ( 0 ) , C T ( 0 ) , C M ( 0 ) , C E ( 0 ) = CAR-T cell dose , 0 , 0 , 0 , 10 7 .
The CAR-T cell dose depends on the patient.
In Table 4, the fixed parameters values taken from the literature are shown.
The aim of this study was to give an estimation of the 13 kinetic parameters:
β , η , r min , p 1 , p 2 , p 3 , A , x i , ϵ , λ , μ , δ , γ .
These are the unknowns that we wished to infer from experimental data.
In Table 5, the medical data of a specific patient (Patient 28) are shown from a study performed in 2021 [15].
Note that, in the studies, only the total number of Car-T cells was shown:
C = C D + C T + C M + C E ,
without considering the different phenotypes, since it was not possible to differentiate them. In Figure 2, we show the plot of C (11), which is in line with the results of A. Paixao. et al. [17].

3.2. Least Squares Results

The least_squares [35] function was used to perform non-linear least squares optimization. The algorithm can be summarized as follows:
  • We define the models (2)–(9);
  • We compare the medical data in Table 5 and the model numerical solution obtained with Runge–Kutta [36], using the solver odeint [35];
  • We set the initial guess for parameters using parameters that the authors obtained in the article [17], shown in Table 6;
  • We used the least_squares function with the bound of having positive parameters, to ensure the existence of the ODEs;
  • The procedure returned the values of the best parameters. We could compare these with the parameters chosen in the article, as shown in Table 7.
In Figure 3, we can observe the plot obtained using the parameters of the article [17] compared with the plot obtained using least_squares solutions. The plot obtained with the least squares method was a better fit compared to the one in the previous article [17]. This improvement in fit indicated that our model captured the underlying trend in the data more accurately.
However, as we pointed out in Section 2.4, we aimed to perform a Bayesian estimation for several reasons. Firstly, our dataset was relatively small, and Bayesian methods are well-suited for situations with limited data. Secondly, they allowed us to incorporate prior knowledge and quantify the uncertainty in our estimates, providing a more comprehensive understanding of the parameter distributions. This approach can give us a general idea of the underlying patterns and potential variability in the data, which is crucial for drawing more informed and robust conclusions.

3.3. MCMC Results

The results of utilizing MCMC methods are presented in Table 8, which shows the mean and standard deviation of the posterior distribution for each parameter. We also give an estimation of σ , which is the variance in the Likelihood function (10).
From the values in Table 8, we obtained the trace plots of the four MCMC algorithms, represented in Figure 4. The trace plots show that we obtained a highly successful Bayesian estimation process, demonstrating excellent convergence and mixing for all parameters. In fact, each chain showed stable mean values and overlapped well with the others, reflecting an efficient and thorough exploration of the parameter space. The posterior distributions were well-defined and smooth, suggesting a strong model fit to the data. The consistency and clarity of these results highlight the robustness and reliability of our Bayesian estimation approach in accurately capturing the underlying parameter distributions. This comprehensive analysis provided a solid foundation for drawing meaningful conclusions from our limited dataset, ensuring that our parameter estimates were both precise and credible.
Moreover, Figure 5 shows four plots of the total CAR-T cell, each representing a comparison of the medical data Table 5 and inference model runs using different sampling methods. The plots demonstrate that each of the four sampling methods (SMC, Metropolis, DEMetropolis, DEMetropolisZ) provided a good fit to the data, capturing the dynamics of the cell count over the period.
To compare the marginal probability of each parameter for each method, we used plot_forest from the Python library ArviZ [37]. Figure 6 shows plots for every parameter.
These plots showcase a comparison of the marginal probability distributions for a set of parameters estimated using different statistical methods. Marginal probabilities are the probabilities of observing a particular value for a parameter, regardless of the values of other parameters. Essentially, they provide insights into the uncertainty and the possible values each parameter could take after considering all the data and prior information available.
The best method, in this case, was DEMetropolisZ, as it generally showed more peaked and distinct distributions for the parameters. This implies a higher level of confidence in the parameter estimates, as there was less uncertainty associated with the parameter values.
Moreover, the distributions resulting from DEMetropolisZ were smoother and more symmetric, which was an indication of the better convergence properties of the algorithm in the parameter space. This suggests that DEMetropolisZ was more efficient in exploring the parameter space and finding the regions of higher probability, which is an important aspect of a good Markov chain Monte Carlo (MCMC) method.
The Metropolis algorithm seemed to produce wider distributions, indicating more uncertainty and less precision in the parameter estimates. On the other hand, SMC appeared to give intermediate results, with varying degrees of uncertainty across the different parameters.
To conclude, DEMetropolisZ stood out as the best method for estimating the marginal probabilities of these parameters, due to its more precise and confident distributions, which indicated a better performance in sampling from the posterior distribution. This could also be observed in the computational times, as we can see in Table 9.
A pair plot is a visual representation of the posterior correlations between various parameters in a statistical model, as obtained by the DEMetropolisZ algorithm. It is a powerful tool for understanding the relationship between multiple variables after Bayesian inference has been performed.
In Figure 7, in which a pair plot of the posteriors correlations is shown, each row and column corresponds to a different parameter, with the histograms on the diagonal showing the marginal distributions of each parameter. The off-diagonal plots show scatter plots for pairs of parameters, which allow us to visually inspect their correlations.
Overall, this pair plot could help in diagnosing potential issues with the statistical model, like identifying parameters that are perhaps too tightly linked or by suggesting transformations or model re-parameterizations to improve the independence of the parameters, leading to more efficient sampling by the MCMC algorithm for future simulations.
Let us look more deeply into the specific parameters in Figure 7.
  • The histograms (diagonal) exhibit the shapes of the marginal posterior distributions for each parameter. The sharpness of the peaks indicates where the data suggest the most credible values lie;
  • The scatter plots (off-diagonal) indicate the degree and pattern of correlation between pairs of parameters. For instance, a circular cloud of points suggests little to no correlation, whereas an elliptical shape oriented along a line indicates a stronger correlation;
  • Some parameters appear to have little correlation with others, as indicated by the round shapes of their scatter plots. This suggests that these parameters independently contributed to the model;
  • If any of the scatter plots showed a very narrow, elongated ellipse, that would indicate a high degree of correlation, implying that one parameter could be predicted from the other. However, in this plot, while some mild correlations are visible, there does not appear to be an excessively strong linear relationship between any pair of parameters;
  • The distribution shapes and scatter plot orientations provide insight into the potential complexity of the statistical model and the interactions between parameters;
  • The marginal distributions (diagonal plots) for parameters like η and σ are fairly symmetrical and bell-shaped, which suggests a well-defined mean value and suggests that the DEMetropolisZ algorithm did a good job of exploring the parameter space around the peak probability;
  • For parameters like p1, p2, and p3, we see distributions that are slightly skewed, which could indicate that the underlying data have some asymmetries or that these parameters are not normally distributed within the model context. This makes sense, since they are part of the same non-linear function in the ODE system (7):
    k ( t ) = r m i n + p 1 1 + ( p 2 t ) p 3 ;
  • Scatter plots for pairs like ( β , γ ) and ( γ , η ) show some degree of correlation, as indicated by the elliptical shapes. This is consistent with the model, since these parameters describe the same CAR-T phenotypes, distributed ( C D ). Moreover, these correlations do not appear to be very strong, which is good because this means that the parameters are relatively independent of each other, and the model did not suffer from multicollinearity issues;
  • Some plots, like those involving r min , show a tighter clustering of points, suggesting a strong correlation or interdependence between r min and other parameters such as beta, delta, and epsilon. This might be important for understanding how changes in r min affect the model or vice versa.
We can conclude that the scatter plots indicate that the algorithm efficiently explored the parameter space, as evidenced by the spread of points without obvious patterns of constraint or limitation, which would suggest areas of the space not being sampled. Moreover, the marginal distributions are smooth and unimodal, which often indicates good convergence. Sharp peaks in the distributions suggest that the algorithm effectively zeroed in on the most likely parameter values. Even in cases where parameters exhibit correlations, DEMetropolis seemed to handle these well, as indicated by the lack of extreme narrow “banana shapes” in the scatter plots, which would suggest difficulty sampling from correlated distributions.

4. Discussion

This work has presented a comprehensive mathematical framework for modeling CAR-T therapy, a groundbreaking approach in the treatment of certain types of cancer. We explored the intricacies of ordinary ODEs in representing the complex dynamics of CAR-T cell phenotypes and their interactions within the human body.
A significant emphasis was placed on advocating for a Bayesian approach over the traditional frequentist methods, such as the least squares optimization algorithm. The Bayesian paradigm allows for the integration of prior medical knowledge and the uncertainties inherent in biological systems, which is critical in the context of personalized medicine. Through the use of Markov chain Monte Carlo (MCMC) methods, we were able to demonstrate how theoretical mathematical constructs can be effectively applied to estimate parameters that are otherwise challenging to ascertain. MCMC methods, supported by the theoretical foundation, enable the selection of suitable priors and likelihoods that are tailored to each unique clinical situation, offering a more robust and individualized model of CAR-T therapy. In this paper, we used standard priors and likelihoods, but in the future, they could be chosen to represent reality in the best way.
Future work could investigate improving these computational models by incorporating machine learning and neural networks. The integration with advanced computing architectures, particularly those utilizing GPU capabilities from providers like NVIDIA, promises to substantially accelerate the computational process. This acceleration could potentially enable real-time customization of therapeutic strategies, making the clinical application of CAR-T cell therapy not only more effective but also more efficient.
The Bayesian approach, therefore, is not just a theoretical preference; it represents a paradigm shift towards a more nuanced and precise understanding of complex medical treatments. As the field of CAR-T cell therapy evolves, the incorporation of such advanced computational techniques will undoubtedly play a fundamental role in the realization of truly personalized medicine. When a patient qualifies for CAR-T therapy, they can be assigned to a specific cohort based on biometric and demographic characteristics such as age, gender, and BMI. Leveraging historical data accumulated for each cohort, we can estimate the kinetic parameters relevant to that group. By identifying the patient’s cohort and applying these kinetic parameters, we can predict the patient’s overall CAR-T cell expansion response using forward ODE simulations. This approach could enable the administration of the optimal dosage to achieve the desired levels of effector and memory CAR-T cells.

5. Conclusions

We developed a comprehensive mathematical framework using ordinary differential equations (ODEs) and Bayesian parameter estimation to model CAR-T cell dynamics. This approach enables a deeper understanding of the behavior and interactions of CAR-T cells within the human body, providing insights into their proliferation, memory, exhaustion, and cytotoxic activities. By employing advanced MCMC methods such as Metropolis–Hastings, DEMetropolis, and DEMetropolisZ, we demonstrated how Bayesian techniques offer significant advantages over traditional frequentist methods, particularly in dealing with the complexities of biological systems and individual variability.
Our results underscore the potential of Bayesian inference to improve the predictive accuracy and clinical efficacy of CAR-T cell therapy. The ability to incorporate prior knowledge and quantify uncertainty allows for a more tailored approach to treatment, aligning with the goals of personalized medicine. By providing valuable insights into the proliferation and cytotoxic activity of CAR-T cells, this approach contributes to ongoing efforts to overcome challenges associated with this innovative treatment modality. In the future, this model could be improved using machine learning and neural networking. Using real clinical data, we could classify and offer a specific treatment based on the patient’s characteristics. Opening the door to personalize medicine in CAR-T.

Supplementary Materials

The following supporting information can be downloaded at https://www.mdpi.com/article/10.3390/cancers16183132/s1, Supplemtary S1: Existence and Uniqueness of the Solution; Supplemtary S2: Bayesian Statistical Methods; Supplemtary S3: MCMC Methods; Supplemtary S4: Metropolis-Hastings; Supplemtary S5: Differential Evolution. References [26,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53] are cited in the Supplementary Materials.

Author Contributions

Conceptualization, V.V.; methodology, E.A. and G.M.; software, E.A.; writing—original draft preparation, E.A.; writing—review and editing, E.A., G.M., S.S.-P., V.V. and R.K.; visualization, E.A.; supervision, G.M., V.V. and R.K.; project administration, G.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Source data are provided in this paper and all data used in this study can be downloaded from the cited sources. All information, such as parameter values, to replicate the simulations and analysis is available in this work.

Conflicts of Interest

Authors Elia Antonini and Gang Mu were employed by the company Cilag GmbH International; Sara Sansaloni-Pastor was employed by the company Actelion Pharmaceuticals Ltd.; Vishal Varma and Ryme Kabak were employed by the company Johnson & Johnson World Headqtrs US.

Abbreviations

The following abbreviations are used in this manuscript:
CARChimeric antigen receptor
ORROverall response rate
CRComplete remission
CRSCytokine release syndrome
TGFTransforming growth factor
ODEOrdinary differential equation
MCMCMarkov chain Monte Carlo
SEStandard error
EAEvolutionary algorithms
DEDifferential evolution
GPUGraphics processing unit
BMIBody Mass Index

References

  1. Kuwana, Y.; Asakura, Y.; Utsunomiya, N.; Nakanishi, M.; Arata, Y.; Itoh, S.; Nagase, F.; Kurosawa, Y. Expression of chimeric receptor composed of immunoglobulin-derived V resions and T-cell receptor-derived C regions. Biochem. Biophys. Res. Commun. 1987, 149, 960–968. [Google Scholar] [CrossRef] [PubMed]
  2. Zhao, Y.; Wang, Q.; Yang, S.; Kochenderfer, J.; Zheng, Z.; Zhong, X.; Sadelain, M.; Eshhar, Z.; Rosenberg, S.; Morgan, R. A herceptin-based chimeric antigen receptor with modified signaling domains leads to enhanced survival of transduced T lymphocytes and antitumor activity. J. Immunol. 2009, 183, 5563–5574. [Google Scholar] [CrossRef] [PubMed]
  3. Cappell, K.; Kochenderfer, J. Long-term outcomes following CAR T cell therapy: What we know so far. Nat. Rev. Clin. Oncol. 2023, 20, 359–371. [Google Scholar] [CrossRef] [PubMed]
  4. Gumber, D.; Wang, L. Improving CAR-T immunotherapy: Overcoming the challenges of T cell exhaustion. eBioMedicine 2022, 77, 103941. [Google Scholar] [CrossRef] [PubMed]
  5. Zhu, X.; Li, Q.; Zhu, X. Mechanisms of CAR T cell exhaustion and current counteraction strategies. Front. Cell. Dev. Biol. 2022, 10, 1034257. [Google Scholar] [CrossRef]
  6. Jubel, J.; Barbati, Z.; Burger, C.; Wirtz, D.; Schildberg, F. The Role of PD-1 in Acute and Chronic Infection. Front. Immunol. 2020, 11, 487. [Google Scholar] [CrossRef]
  7. Liu, G.; Zhang, Q.; Li, D.; Zhang, L.; Gu, Z.; Liu, J.; Liu, G.; Yang, M.; Gu, J.; Cui, X.; et al. PD-1 silencing improves anti-tumor activities of human mesothelin-targeted CAR T cells. Hum. Immunol. 2020, 82, 130–138. [Google Scholar] [CrossRef]
  8. Chen, X.; Yang, S.; Li, S.; Qu, Y.; Wang, H.; Liu, J.; Dunn, Z.; Cinay, G.; MacMullan, M.; Hu, F.; et al. Secretion of bispecific protein of anti-PD-1 fused with TGF-β trap enhances antitumor efficacy of CAR-T cell therapy. Mol. Ther. Oncolytics 2021, 21, 144–157. [Google Scholar] [CrossRef]
  9. Kumar, J.; Kumar, R.; Singh, A.K.; Tsakem, E.; Kathania, M.; Riese, M.; Theiss, A.; Davila, M.; Venuprasad, K. Deletion of Cbl-b inhibits CD8(+) T-cell exhaustion and promotes CAR T-cell function. J. Immunother. Cancer 2021, 9, e001688. [Google Scholar] [CrossRef]
  10. Lynn, R.; Weber, E.; Sotillo, E.; Gennert, D.; Xu, P.; Good, Z.; Anbunathan, H.; Lattin, J.; Jones, R.; Tieu, V.; et al. c-Jun overexpression in CAR T cells induces exhaustion resistance. Nature 2019, 576, 293–300. [Google Scholar] [CrossRef]
  11. Nixdorf, D.; Sponheimer, M.; Berghammer, D.; Engert, F.; Bader, U.; Philipp, N.; Kazerani, M.; Straub, T.; Rohrbacher, L.; Wange, L.; et al. Adapter CAR T cells to counteract T-cell exhaustion and enable flexible targeting in AML. Leukemia 2023, 37, 1298–1310. [Google Scholar] [CrossRef] [PubMed]
  12. Chaudhury, A.; Zhu, X.; Chu, L.; Goliaei, A.; June, C.; Kearns, J.; Stein, A. Chimeric Antigen Receptor T Cell Therapies: A Review of Cellular Kinetic-Pharmacodynamic Modeling Approaches. J. Clin. Pharmacol. 2020, 60, S147–S159. [Google Scholar] [CrossRef] [PubMed]
  13. Singh, A.P.; Zheng, X.; Lin-Schmidt, X.; Chen, W.; Carpenter, T.J.; Zong, A.; Wang, W.; Heald, D.L. Development of a quantitative relationship between CAR-affinity, antigen abundance, tumor cell depletion and CAR-T cell expansion using a multiscale systems PK-PD model. MAbs 2020, 12, 1688616. [Google Scholar] [CrossRef] [PubMed]
  14. Barros, L.; Paixão, E.; Valli, A.; Naozuka, G.; Fassoni, A.; Almeida, R. CARTmath—A Mathematical Model of CAR-T Immunotherapy in Preclinical Studies of Hematological Cancers. Cancers 2021, 13, 2941. [Google Scholar] [CrossRef] [PubMed]
  15. Liu, C.; Ayyar, V.; Zheng, X.; Chen, W.; Zheng, S.; Mody, H.; Wang, W.; Heald, D.; Singh, A.; Cao, Y. Model-Based Cellular Kinetic Analysis of Chimeric Antigen Receptor-T Cells in Humans. Clin. Pharmacol. Ther. 2021, 109, 716–727. [Google Scholar] [CrossRef]
  16. Brummer, A.; Xella, A.; Woodall, R.; Adhikarla, V.; Cho, H.; Gutova, M.; Brown, C.; Rockne, R. Data driven model discovery and interpretation for CAR T-cell killing using sparse identification and latent variables. Front. Immunol. 2023, 14, 1115536. [Google Scholar] [CrossRef]
  17. Paixão, E.; Barros, L.; Fassoni, A.; Almeida, R. Modeling Patient-Specific CAR-T Cell Dynamics: Multiphasic Kinetics via Phenotypic Differentiation. Cancers 2022, 14, 5576. [Google Scholar] [CrossRef]
  18. Douc, R.; Moulines, E.; Priouret, P.; Soulier, P. Markov Chains; Springer: Berlin/Heidelberg, Germany, 2018. [Google Scholar]
  19. Weinzierl, S. Introduction to Monte Carlo Methods; Springer: Berlin/Heidelberg, Germany, 2000. [Google Scholar]
  20. Linden, N.J.; Kramer, B.; Rangamani, P. Linden Bayesian parameter estimation for dynamical models in systems biology. PLoS Comput. Biol. 2022, 18, e1010651. [Google Scholar] [CrossRef]
  21. Fabreti, L.; Höhna, S. Convergence assessment for Bayesian phylogenetic analysis using MCMC simulation. Methods Ecol. Evol. 2022, 13, 77–90. [Google Scholar] [CrossRef]
  22. Keersmaekers, N.; Ogunjimi, B.; Van Damme, P.; Beutels, P.; Hens, N. An ODE-based mixed modelling approach for B- and T-cell dynamics induced by Varicella-Zoster Virus vaccines in adults shows higher T-cell proliferation with Shingrix than with Varilrix. Vaccine 2019, 37, 2537–2553. [Google Scholar] [CrossRef]
  23. Dang, T.; Han, J.; Xia, T.; Bondareva, E.; Siegele-Brown, C.; Chauhan, J.; Grammenos, A.; Spathis, D.; Cicuta, P.; Mascolo, C. Conditional Neural ODE Processes for Individual Disease Progression Forecasting: A Case Study on COVID-19. In Proceedings of the 29th ACM SIGKDD Conference On Knowledge Discovery and Data Mining, Long Beach, CA, USA, 6–10 August 2023; pp. 3914–3925. [Google Scholar] [CrossRef]
  24. Sherri, M.; Boulkaibet, I.; Marwala, T.; Friswell, M. A Differential Evaluation Markov Chain Monte Carlo algorithm for Bayesian Model Updating. arXiv 2017, arXiv:1710.09486. [Google Scholar]
  25. Ter Braak, C.; Vrugt, J. Differential evolution Markov chain with snooker updater and fewer chains. Stat. Comput. 2008, 18, 435–446. [Google Scholar] [CrossRef]
  26. Feoktistov, V. Differential Evolution; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  27. Valderrama-Bahamóndez, G.; Fröhlich, H. MCMC Techniques for Parameter Estimation of ODE Based Models in Systems Biology. Front. Appl. Math. Stat. 2019, 5, 55. [Google Scholar] [CrossRef]
  28. Abril-Pla, O.; Andreani, V.; Carroll, C.; Dong, L.; Fonnesbeck, C.J.; Kochurov, M.; Kumar, R.; Lao, J.; Luhmann, C.C.; Martin, O.A.; et al. PyMC: A Modern and Comprehensive Probabilistic Programming Framework in Python. PeerJ Comput. Sci. 2023, 9, e1516. [Google Scholar] [CrossRef] [PubMed]
  29. Owens, K.; Bozic, I. Modeling CAR T-Cell Therapy with Patient Preconditioning. Bull. Math. Biol. 2021, 83, 42. [Google Scholar] [CrossRef] [PubMed]
  30. Gilks, W.; Roberts, G.; George, E. Adaptive Direction Sampling. J. R. Stat. Soc. Ser. D Stat. 2018, 43, 179–189. [Google Scholar] [CrossRef]
  31. Roberts, G.; Gilks, W. Convergence of adaptive direction sampling. J. Multivar. Anal. 1994, 49, 287–298. [Google Scholar] [CrossRef]
  32. Haario, H.; Saksman, E.; Tamminen, J. An adaptive Metropolis algorithm. Bernoulli 2001, 7, 223–242. [Google Scholar] [CrossRef]
  33. Roberts, G.; Rosenthal, J. Coupling and ergodicity of adaptive Markov chain Monte Carlo algorithms. J. Appl. Probab. 2007, 44, 458–475. [Google Scholar] [CrossRef]
  34. Roberts, G.; Rosenthal, J. Examples of adaptive MCMC. J. Comput. Graph. Stat. 2009, 18, 349–367. [Google Scholar] [CrossRef]
  35. Virtanen, P.; Gommers, R.; Oliphant, T.; Haberl, M.; Reddy, T.; Cournapeau, D.; Burovski, E.; Peterson, P.; Weckesser, W.; Bright, J.; et al. SciPy 1.0 Contributors SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nat. Methods 2020, 17, 261–272. [Google Scholar] [CrossRef] [PubMed]
  36. Faires, J.D.; Burden, R.L. Numerical Methods; Cengage Learning: Belmont, CA, USA, 2003. [Google Scholar]
  37. Kumar, R.; Carroll, C.; Hartikainen, A.; Martin, O. ArviZ a unified library for exploratory analysis of Bayesian models in Python. J. Open Source Softw. 2019, 4, 1143. [Google Scholar] [CrossRef]
  38. Lindelöf, E. Sur l’application de la méthode des approximations successives aux équations différentielles ordinaires du premier ordre. Comptes Rendus Hebd. Séances L’Académie Sci. 1894, 116, 454–457. [Google Scholar]
  39. Hartman, P. Ordinary Differential Equations, 2nd ed.; Society for Industrial: Philadelphia, PA, USA, 1982. [Google Scholar]
  40. Dekking, F. A Modern Introduction to Probability and Statistics: Understanding Why and How; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
  41. Robert, C.; Casella, G. Monte Carlo Statistical Methods; Springer: New York, NY, USA, 2004; ISBN 978-0-387-21239-5/978-1-4419-1939-7/978-1-4757-4145-2. [Google Scholar] [CrossRef]
  42. Chib, S.; Greenberg, E. Understanding the metropolis-hastings algorithm. Am. Stat. 1995, 49, 327–335. [Google Scholar] [CrossRef]
  43. Tomic, S.; Beko, M.; Camarinha-Matos, L.; Oliveira, L. Distributed Localization with Complemented RSS and AOA Measurements: Theory and Methods. Appl. Sci. 2019, 10, 272. [Google Scholar] [CrossRef]
  44. Spears, W.; De Jong, K.; Bäck, T.; Fogel, D.; De Garis, H. An overview of evolutionary computation. In European Conference on Machine Learning; Springer: Berlin/Heidelberg, Germany, 1993; pp. 442–459. [Google Scholar]
  45. Holland, J. Adaptation in Natural and Artificial Systems. An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence; University of Michigan Press: Ann Arbor, MI, USA, 1975. [Google Scholar]
  46. De Jong, K. An Analysis of the Behavior of a Class of Genetic Adaptive Systems; University of Michigan: Ann Arbor, MI, USA, 1975. [Google Scholar]
  47. Goldberg, D.; Holland, J. Genetic Algorithms and Machine Learning. Mach. Learn. 1988, 3, 95–99. [Google Scholar] [CrossRef]
  48. Rechenberg, I. Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution; Frommann-Holzboog: Stuttgart, Germany, 1973. [Google Scholar]
  49. Schwefel, H. Numerical Optimization of Computer Models; Wiley: Hoboken, NJ, USA, 1981. [Google Scholar]
  50. Fogel, L.; Owens, A.; Walsh, M. Artificial Intelligence through Simulated Evolution; Wiley: Hoboken, NJ, USA, 1966. [Google Scholar]
  51. Fogel, D. Evolving Artificial Intelligence; University of California at San Diego: San Diego, CA, USA, 1992. [Google Scholar]
  52. Koza, J. Genetic Programming: On the Programming of Computers by Means of Natural Selection; Bradford: Holland, MI, USA, 1992. [Google Scholar]
  53. Storn, R.; Price, K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997, 11, 341–359. [Google Scholar] [CrossRef]
Figure 2. Plot of medical data for patient 28.
Figure 2. Plot of medical data for patient 28.
Cancers 16 03132 g002
Figure 3. Comparison between the plots of the total CAR-T cells () obtained with the parameters from the article (a) and the least_squares method (b). The medical data () from Table 5.
Figure 3. Comparison between the plots of the total CAR-T cells () obtained with the parameters from the article (a) and the least_squares method (b). The medical data () from Table 5.
Cancers 16 03132 g003
Figure 4. Comparison between the trace plots of kinetic parameters obtained with SMC (a), Metropolis (b), DEMetropolis (c), and DEMetropolisZ (d). Each plot was obtained with 10,000 draws and 16 chains in parallel.
Figure 4. Comparison between the trace plots of kinetic parameters obtained with SMC (a), Metropolis (b), DEMetropolis (c), and DEMetropolisZ (d). Each plot was obtained with 10,000 draws and 16 chains in parallel.
Cancers 16 03132 g004
Figure 5. Comparison between the total CAR-T cell plots of the different trajectories for each of the algorithms (). SMC (a), Metropolis (b), DEMetropolis (c), and DEMetropolisZ (d) and the medical data () from Table 5.
Figure 5. Comparison between the total CAR-T cell plots of the different trajectories for each of the algorithms (). SMC (a), Metropolis (b), DEMetropolis (c), and DEMetropolisZ (d) and the medical data () from Table 5.
Cancers 16 03132 g005
Figure 6. Forest plots of marginal probabilities (“dispersion coefficient” = (97.5th percentile value − 2.5th percentile value)/mean value) of every kinetic parameter. These plots compare four methods: DEMetropolisZ (), DEMetropolis (), Metropolis algorithm (), and sequential Monte Carlo, SMC ().
Figure 6. Forest plots of marginal probabilities (“dispersion coefficient” = (97.5th percentile value − 2.5th percentile value)/mean value) of every kinetic parameter. These plots compare four methods: DEMetropolisZ (), DEMetropolis (), Metropolis algorithm (), and sequential Monte Carlo, SMC ().
Cancers 16 03132 g006
Figure 7. DEMetropolisZ pair plot of the posterior correlations.
Figure 7. DEMetropolisZ pair plot of the posterior correlations.
Cancers 16 03132 g007
Table 1. Non-patient-dependent parameters with their units and biological meanings.
Table 1. Non-patient-dependent parameters with their units and biological meanings.
ParameterUnitBiological Meaning
α (cell · day) −1 Inhibition coefficient of effector CAR-T cells due to interaction with tumor cells.
rday −1Maximum growth rate of tumor cells.
bcell −1Inverse of the carrying capacity of tumor cells.
ϑ -Half-saturation constant of the cytotoxic effect on tumor cells.
θ (cell · day) −1Conversion coefficient of memory CAR-T cells into effector CAR-T cells due to interaction with tumor cells.
acellHalf-saturation constant of f ( C T , T ) .
Table 2. Patient parameters with their units and biological meanings.
Table 2. Patient parameters with their units and biological meanings.
ParameterUnitBiological Meaning
β day −1Reduction rate of infused cells due to natural death during their distribution.
η day −1Engraftment rate of injected cells to blood and tumor niche.
r min day −1Minimum expansion rate of effector CAR-T cells.
p 1 day −1Initial expansion rate of effector CAR-T cells.
p 2 day −1Rate that regulates the duration of maximum expansion period of effector CAR-T cells.
p 3 -Expansion coefficient that regulates decay of maximum expansion period of effector CAR-T cells.
AcellHalf-saturation constant of F ( T ) .
ξ day −1Death rate of effector CAR-T cells.
ϵ day −1Conversion rate of effector CAR-T cells into memory CAR-T cells.
λ day −1Exhaustion rate of effector CAR-T cells.
μ day −1Death rate of memory CAR-T cells.
δ day −1Death rate of exhausted CAR-T cells.
γ day −1Cytotoxic rate of functional CAR-T cells on tumor cells.
Table 3. MCMC algorithms with their advantages and disadvantages.
Table 3. MCMC algorithms with their advantages and disadvantages.
AlgorithmAdvantagesDisadvantages
Metropolis
  • Simple to implement;
  • Works well for low-dimensional problems;
  • Requires fewer assumptions about the target distribution.
  • Can be slow to converge;
  • Sensitive to the choice of proposal distribution;
  • Inefficient for high-dimensional or complex posterior distributions.
DEMetropolis
  • Adapts to the posterior distribution;
  • Can handle high-dimensional and multimodal distributions.
  • Can be computationally expensive;
  • Requires a large population size for effective sampling.
DEMetropolisZ
  • Better mixing and convergence properties compared to DEMetropolis;
  • More efficient posterior distribution adaptation.
  • Requires careful tuning of parameters’ prior distributions;
  • Can be computationally intensive.
SMC
  • Can handle multimodal distributions;
  • Effective for complex posterior landscapes;
  • Adaptable to changing target distributions.
  • Slow convergence and computationally intensive;
  • Requires careful tuning of resampling steps;
  • Less efficient for high-dimensional problems.
Table 4. Fixed parameters, including their respective units, values, and references to the articles from which they were taken.
Table 4. Fixed parameters, including their respective units, values, and references to the articles from which they were taken.
ParameterUnitValueReference
α (cell · day) −15.500 × 10−7[17]
rday −11.760 × 10−1[29]
bcell −15.000 × 10−13[29]
ϑ -3.050 × 10−1[29]
θ (cell · day) −16.000 × 10−6[14]
acell1.000 × 103[17]
Table 5. Medical data of patient 28 [15]. Total number of CAR-T cells (C) with the corresponding day.
Table 5. Medical data of patient 28 [15]. Total number of CAR-T cells (C) with the corresponding day.
DayTotal CAR-T Cells (C)
09.230 × 107
21.128 × 107
34.029 × 107
43.106 × 108
61.070 × 109
114.786 × 108
123.259 × 108
152.245 × 108
191.372 × 108
201.340 × 108
267.801 × 107
Table 6. Kinetic parameters value for Patient 28 taken from article [15].
Table 6. Kinetic parameters value for Patient 28 taken from article [15].
ParameterValue
β 1.051
η 5.400 × 10−2
r min 1.000 × 10−3
p 1 1.750
p 2 7.539 × 10−25
p 3 3.100 × 101
A5.000 × 101
ξ 2.548 × 10−1
ϵ 6.000 × 10−2
λ 1.000 × 10−1
μ 9.010 × 10−2
δ 1.498 × 10−1
γ 2.250
Table 7. Comparison of the parameter values taken from article [17] and obtained with the least squares function.
Table 7. Comparison of the parameter values taken from article [17] and obtained with the least squares function.
ParameterArticle ValueLeast Squares SolutionDifference
β 1.0511.4123.611 × 10−1
η 5.400 × 10−26.432 × 10−34.757 × 10−2
r min 1.000 × 10−34.127 × 10−14.117 × 10−1
p 1 1.7502.1163.657 × 10−1
p 2 7.539 × 10−251.000 × 10−101.000 × 10−10
p 3 3.100 × 1013.100 × 1010
A5.00 × 1015.159 × 1011.591
ξ 2.548 × 10−12.121 × 10−14.263 × 10−2
ϵ 6.000 × 10−28.849 × 10−22.849 × 10−2
λ 1.000 × 10−17.111 × 10−22.889 × 10−2
μ 9.010 × 10−29.036 × 10−22.558 × 10−4
δ 1.498 × 10−13.121 × 10−11.624 × 10−1
γ 2.2502.7965.465 × 10−1
Table 8. Means and standard deviations of the posterior distribution of the parameters with MCMC methods.
Table 8. Means and standard deviations of the posterior distribution of the parameters with MCMC methods.
ParameterSMC Metropolis
Mean SD Mean SD
β 1.3184.160 × 10−1 1.3124.070 × 10−1
η 1.170 × 10−14.500 × 10−2 1.160 × 10−14.400 × 10−2
r min 6.400 × 10−25.000 × 10−3 6.400 × 10−25.000 × 10−3
p 1 1.8161.510 × 10−1 1.8181.430 × 10−1
p 2 1.010 × 10−101.400 × 10−11 1.012 × 10−101.020 × 10−11
p 3 3.105 × 1014.939 3.099 × 1015.032
A5.007 × 1014.962 5.001 × 1015.043
ξ 2.950 × 10−14.400 × 10−2 2.960 × 10−14.400 × 10−2
δ 2.240 × 10−14.000 × 10−2 2.240 × 10−14.000 × 10−2
ϵ 1.160 × 10−13.400 × 10−2 1.170 × 10−13.400 × 10−2
λ 1.650 × 10−14.700 × 10−2 1.670 × 10−14.900 × 10−2
μ 8.800 × 10−25.000 × 10−3 8.800 × 10−25.000 × 10−3
γ 2.5088.800 × 10−2 2.5078.500 × 10−2
σ 3.476 × 1079.728 × 106 3.421 × 1079.683 × 106
ParameterDEMetropolis DEMetropolisZ
MeanSD MeanSD
β 1.3183.640 × 10−1 1.3463.960 × 10−1
η 1.140 × 10−14.500 × 10−2 1.150 × 10−14.400 × 10−2
r min 6.400 × 10−25.000 × 10−3 6.400 × 10−25.000 × 10−3
p 1 1.8271.510 × 10−1 1.8291.510 × 10−1
p 2 1.010 × 10−101.030 × 10−11 1.013 × 10−101.010 × 10−11
p 3 3.141 × 1014.791 3.105 × 1014.847
A5.025 × 1014.655 5.024 × 1014.807
ξ 2.950 × 10−14.000 × 10−2 2.920 × 10−14.300 × 10−2
δ 2.240 × 10−13.800 × 10−2 2.240 × 10−13.800 × 10−2
ϵ 1.180 × 10−13.200 × 10−2 1.170 × 10−13.200 × 10−2
λ 1.630 × 10−14.300 × 10−2 1.690 × 10−14.100 × 10−2
μ 8.800 × 10−25.000 × 10−3 8.800 × 10−25.000 × 10−3
γ 2.5138.200 × 10−2 2.5158.600 × 10−2
σ 3.107 × 1078.603 × 106 3.331 × 1079.154 × 106
Table 9. Computational times of the algorithms.
Table 9. Computational times of the algorithms.
AlgorithmComputational Time (s)
SMC1.675 × 104
Metropolis-Hastings3.798 × 103
DEMetropolis6.570 × 102
DEMetropolisZ3.100 × 102
least_squares5.910
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Antonini, E.; Mu, G.; Sansaloni-Pastor, S.; Varma, V.; Kabak, R. MCMC Methods for Parameter Estimation in ODE Systems for CAR-T Cell Cancer Therapy. Cancers 2024, 16, 3132. https://doi.org/10.3390/cancers16183132

AMA Style

Antonini E, Mu G, Sansaloni-Pastor S, Varma V, Kabak R. MCMC Methods for Parameter Estimation in ODE Systems for CAR-T Cell Cancer Therapy. Cancers. 2024; 16(18):3132. https://doi.org/10.3390/cancers16183132

Chicago/Turabian Style

Antonini, Elia, Gang Mu, Sara Sansaloni-Pastor, Vishal Varma, and Ryme Kabak. 2024. "MCMC Methods for Parameter Estimation in ODE Systems for CAR-T Cell Cancer Therapy" Cancers 16, no. 18: 3132. https://doi.org/10.3390/cancers16183132

APA Style

Antonini, E., Mu, G., Sansaloni-Pastor, S., Varma, V., & Kabak, R. (2024). MCMC Methods for Parameter Estimation in ODE Systems for CAR-T Cell Cancer Therapy. Cancers, 16(18), 3132. https://doi.org/10.3390/cancers16183132

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop