Search

The current approach to selection of a population PK/PD model is inherently flawed as it fails to account for interactions between structural, covariate, and statistical parameters. Further, the current approach requires significant manual and redundant model modifications that heavily lend themselves to automation. Within the discipline of numerical optimization it falls into the "local search" category. Genetic algorithms are a class of algorithms inspired by the mathematics of evolution. GAs are general, powerful, robust algorithms and can be used to find global optimal solutions for difficult problems even in the presence of non-differentiable functions, as is the case in the discrete nature of including/excluding model components in search of the best performing mixed-effects PK/PD model. A genetic algorithm implemented in an R-based NONMEM workbench for identification of near optimal models is presented. In addition to the GA capabilities, the workbench supports modeling efforts by: (1) Organizing and displaying models in tabular format, allowing the user to sort, filter, edit, create, and delete models seamlessly, (2) displaying run results, parameter estimates and precisions, (3) integrating xpose4 and PsN to facilitate generation of model diagnostic plots and run PsN scripts, (4) running regression models between post-hoc parameter estimates and covariates. This approach will further facilitate the scientist to shift efforts to focus on model evaluation, hypotheses generation, and interpretation and applications of resulting models., (© 2021. The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.)

Covariate identification is an important step in the development of a population pharmacokinetic/pharmacodynamic model. Among the different available approaches, the stepwise covariate model (SCM) is the most used. However, SCM is based on a local search strategy, in which the model-building process iteratively tests the addition or elimination of a single covariate at a time given all the others. This introduces a heuristic to limit the searching space and then the computational complexity, but, at the same time, can lead to a suboptimal solution. The application of genetic algorithms (GAs) for covariate selection has been proposed as a possible solution to overcome these limitations. However, their actual use during model building is limited by the extremely high computational costs and convergence issues, both related to the number of models being tested. In this paper, we proposed a new GA for covariate selection to address these challenges. The GA was first developed on a simulated case study where the heuristics introduced to overcome the limitations affecting currently available GA approaches resulted able to limit the selection of redundant covariates, increase replicability of results and reduce convergence times. Then, we tested the proposed GA on a real-world problem related to remifentanil. It obtained good results both in terms of selected covariates and fitness optimization, outperforming the SCM., (© 2023. The Author(s).)

The building of population pharmacokinetic models can be described as an iterative process in which given a model and a dataset, the pharmacometrician introduces some changes to the model specification, then perform an evaluation and based on the predictions obtained performs further optimization. This process (perform an action, witness a result, optimize your knowledge) is a perfect scenario for the implementation of Reinforcement Learning algorithms. In this paper we present the conceptual background and a implementation of one of those algorithms aiming to show pharmacometricians how to automate (to a certain point) the iterative model building process.We present the selected discretization for the action and the state space. SARSA (State-Action-Reward-State-Action) was selected as the RL algorithm to use, configured with a window of 1000 episodes with and a limit of 30 actions per episode. SARSA was configured to control an interface to the Non-Parametric Optimal Design algorithm, that was actually performing the parameter optimization.The Reinforcement Learning (RL) based agent managed to obtain the same likelihood and number of support points, with a distribution similar to the reported in the original paper. The total amount of time used by the train the agent was 5.5 h although we think this time can be further improved. It is possible to automatically find the structural model that maximizes the final likelihood for an specific pharmacokinetic dataset by using RL algorithm. The framework provided could allow the integration of even more actions i.e: add/remove covariates, non-linear compartments or the execution of secondary analysis. Many limitations were found while performing this study but we hope to address them all in future studies., (© 2022. The Author(s).)

Population pharmacokinetic (PK) modeling methods can be statistically classified as either parametric or nonparametric (NP). Each classification can be divided into maximum likelihood (ML) or Bayesian (B) approaches. In this paper we discuss the nonparametric case using both maximum likelihood and Bayesian approaches. We present two nonparametric methods for estimating the unknown joint population distribution of model parameter values in a pharmacokinetic/pharmacodynamic (PK/PD) dataset. The first method is the NP Adaptive Grid (NPAG). The second is the NP Bayesian (NPB) algorithm with a stick-breaking process to construct a Dirichlet prior. Our objective is to compare the performance of these two methods using a simulated PK/PD dataset. Our results showed excellent performance of NPAG and NPB in a realistically simulated PK study. This simulation allowed us to have benchmarks in the form of the true population parameters to compare with the estimates produced by the two methods, while incorporating challenges like unbalanced sample times and sample numbers as well as the ability to include the covariate of patient weight. We conclude that both NPML and NPB can be used in realistic PK/PD population analysis problems. The advantages of one versus the other are discussed in the paper. NPAG and NPB are implemented in R and freely available for download within the Pmetrics package from www.lapk.org.

NONMEM is one of the most popular approaches to a population pharmacokinetics/pharmacodynamics (PK/PD) analysis in fitting nonlinear mixed-effects models. As a local optimization algorithm, NONMEM usually requires an initial value close enough to the global optimum. This paper proposes a novel global search algorithm called P-NONMEM. It combines the global search strategy by particle swarm optimization (PSO) and the local estimation strategy of NONMEM. In the proposed algorithm, initial values (particles) are generated randomly by PSO, and NONMEM is implemented for each particle to find a local optimum for fixed effects and variance parameters. P-NONMEM guarantees the global optimization for fixed effects and variance parameters. Under certain regularity conditions, it also leads to global optimization for random effects. Because P-NONMEM doesn't run PSO search for random effect estimation, it avoids tremendous computational burden. In the simulation studies, we have shown that P-NONMEM has much improved convergence performance than NONMEM. Even when the initial values were far away from the global optima, P-NONMEM converged nicely for all fixed effects, random effects, and variance components.