arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.01283q-bio.QM
收藏

一种用于生物数学模型实用可辨识性分析的系统计算框架

A Systematic Computational Framework for Practical Identifiability Analysis in Mathematical Models Arising from Biology

Penn State University(宾夕法尼亚州立大学)

Shun Wang, Wenrui Hao

AI总结:

本文提出了一种系统计算框架,用于评估生物数学模型中参数的实用可辨识性,通过数学定义和新度量标准提高分析效率,并展示其在揭示生物过程中的应用效果。

摘要:

实用可辨识性是数据驱动建模中的关键问题。本文提出了一种新的实用可辨识性分析框架,用于评估生物系统数学模型中的参数可辨识性。从严格的数学定义出发,我们证明了实用可辨识性与Fisher信息矩阵的可逆性等价。我们的框架建立了实用可辨识性与坐标可辨识性之间的关系,引入了一种新的度量标准,简化并加速了参数可辨识性的评估,比轮廓似然方法更高效。此外,我们引入了新的正则化项来处理不可辨识参数,使不确定性量化和提高模型可靠性成为可能。为了指导实验设计,我们提出了一个最优数据收集算法,确保所有模型参数都能被实际辨识。对Hill函数、神经网络和动态生物模型的应用展示了所提出的计算框架在揭示关键生物过程和识别关键可观察变量方面的可行性和效率。

英文摘要:

Practical identifiability is a critical concern in data-driven modeling of mathematical systems. In this paper, we propose a novel framework for practical identifiability analysis to evaluate parameter identifiability in mathematical models of biological systems. Starting with a rigorous mathematical definition of practical identifiability, we demonstrate its equivalence to the invertibility of the Fisher Information Matrix. Our framework establishes the relationship between practical identifiability and coordinate identifiability, introducing a novel metric that simplifies and accelerates the evaluation of parameter identifiability compared to the profile likelihood method. Additionally, we introduce new regularization terms to address non-identifiable parameters, enabling uncertainty quantification and improving model reliability. To guide experimental design, we present an optimal data collection algorithm that ensures all model parameters are practically identifiable. Applications to Hill functions, neural networks, and dynamic biological models demonstrate the feasibility and efficiency of the proposed computational framework in uncovering critical biological processes and identifying key observable variables.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑