<p>Virtual population (Vpop) generation is a central component of quantitative systems pharmacology (QSP), involving the sampling of parameter sets that represent physiologically plausible patients (PPs) and capture observed inter-individual variability in clinical outcomes. This approach poses challenges due to the high dimensionality and often non-identifiability nature of many QSP models. In this study, we evaluate the performance of the DREAM(ZS) algorithm, a multi-chain adaptive Markov chain Monte Carlo (MCMC) method for generating Vpop. Using the Van De Pas model of cholesterol metabolism as a case study, we compare DREAM(ZS) to the single-chain Metropolis–Hastings (MH) algorithm adopted by Rieger et al. Our comparison focuses on convergence behavior, parametric diversity, and posterior coverage, in relation to the ability of each method to explore complex parameter distributions and maintain outcomes&#xa0;correlations. DREAM(ZS) demonstrates superior exploration of the parameter space, reducing boundary accumulation effects common in traditional MH sampling, and restoring parameter correlation structures. These advantages are attributed in part to its adaptive proposal mechanism and the use of a bias-corrected likelihood formulation, which together contribute to a better parameters space sampling without compromising model fit. Our findings contribute to the ongoing development of efficient sampling methodologies for high-dimensional biological models, introducing a promising and easy to use alternative for Vpop generation in QSP, expanding the methodological approaches for in silico trial simulation.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Generation of Virtual Populations for Quantitative Systems Pharmacology Through Advanced Sampling Methods

  • Miriam Schirru,
  • Tristan Brier,
  • Maxime Petit,
  • Didier Zugaj,
  • Pierre-Olivier Tremblay,
  • Fahima Nekka

摘要

Virtual population (Vpop) generation is a central component of quantitative systems pharmacology (QSP), involving the sampling of parameter sets that represent physiologically plausible patients (PPs) and capture observed inter-individual variability in clinical outcomes. This approach poses challenges due to the high dimensionality and often non-identifiability nature of many QSP models. In this study, we evaluate the performance of the DREAM(ZS) algorithm, a multi-chain adaptive Markov chain Monte Carlo (MCMC) method for generating Vpop. Using the Van De Pas model of cholesterol metabolism as a case study, we compare DREAM(ZS) to the single-chain Metropolis–Hastings (MH) algorithm adopted by Rieger et al. Our comparison focuses on convergence behavior, parametric diversity, and posterior coverage, in relation to the ability of each method to explore complex parameter distributions and maintain outcomes correlations. DREAM(ZS) demonstrates superior exploration of the parameter space, reducing boundary accumulation effects common in traditional MH sampling, and restoring parameter correlation structures. These advantages are attributed in part to its adaptive proposal mechanism and the use of a bias-corrected likelihood formulation, which together contribute to a better parameters space sampling without compromising model fit. Our findings contribute to the ongoing development of efficient sampling methodologies for high-dimensional biological models, introducing a promising and easy to use alternative for Vpop generation in QSP, expanding the methodological approaches for in silico trial simulation.