{"title":"通过先进的采样方法为定量系统药理学生成虚拟种群。","authors":"Miriam Schirru, Tristan Brier, Maxime Petit, Didier Zugaj, Pierre-Olivier Tremblay, Fahima Nekka","doi":"10.1007/s11538-025-01532-z","DOIUrl":null,"url":null,"abstract":"<p><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 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>","PeriodicalId":9372,"journal":{"name":"Bulletin of Mathematical Biology","volume":"87 11","pages":"165"},"PeriodicalIF":2.2000,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generation of Virtual Populations for Quantitative Systems Pharmacology Through Advanced Sampling Methods.\",\"authors\":\"Miriam Schirru, Tristan Brier, Maxime Petit, Didier Zugaj, Pierre-Olivier Tremblay, Fahima Nekka\",\"doi\":\"10.1007/s11538-025-01532-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><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 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>\",\"PeriodicalId\":9372,\"journal\":{\"name\":\"Bulletin of Mathematical Biology\",\"volume\":\"87 11\",\"pages\":\"165\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2025-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Mathematical Biology\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11538-025-01532-z\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"BIOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Mathematical Biology","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11538-025-01532-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"BIOLOGY","Score":null,"Total":0}
引用次数: 0
摘要
虚拟群体(Vpop)生成是定量系统药理学(QSP)的核心组成部分,涉及代表生理上合理的患者(PPs)的参数集采样,并捕获观察到的临床结果的个体间差异。由于许多QSP模型的高维性和通常的不可识别性,这种方法提出了挑战。在本研究中,我们评估了DREAM(ZS)算法的性能,DREAM(ZS)算法是一种用于生成Vpop的多链自适应马尔可夫链蒙特卡罗(MCMC)方法。以Van De Pas胆固醇代谢模型为例,我们将DREAM(ZS)与Rieger等人采用的单链Metropolis-Hastings (MH)算法进行了比较。我们的比较侧重于收敛行为、参数多样性和后验覆盖率,以及每种方法探索复杂参数分布和保持结果相关性的能力。DREAM(ZS)展示了对参数空间的卓越探索,减少了传统MH采样中常见的边界积累效应,并恢复了参数相关结构。这些优势部分归功于其自适应建议机制和使用偏差校正似然公式,它们共同有助于在不影响模型拟合的情况下进行更好的参数空间采样。我们的研究结果有助于高维生物模型高效采样方法的持续发展,为QSP中Vpop生成引入了一种有前途且易于使用的替代方法,扩展了硅片试验模拟的方法方法。
Generation of Virtual Populations for Quantitative Systems Pharmacology Through Advanced Sampling Methods.
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.
期刊介绍:
The Bulletin of Mathematical Biology, the official journal of the Society for Mathematical Biology, disseminates original research findings and other information relevant to the interface of biology and the mathematical sciences. Contributions should have relevance to both fields. In order to accommodate the broad scope of new developments, the journal accepts a variety of contributions, including:
Original research articles focused on new biological insights gained with the help of tools from the mathematical sciences or new mathematical tools and methods with demonstrated applicability to biological investigations
Research in mathematical biology education
Reviews
Commentaries
Perspectives, and contributions that discuss issues important to the profession
All contributions are peer-reviewed.