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

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Wang, Shun, Hao, Wenrui
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917181398188032
author Wang, Shun
Hao, Wenrui
author_facet Wang, Shun
Hao, Wenrui
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2501_01283
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Systematic Computational Framework for Practical Identifiability Analysis in Mathematical Models Arising from Biology
Wang, Shun
Hao, Wenrui
Quantitative Methods
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.
title A Systematic Computational Framework for Practical Identifiability Analysis in Mathematical Models Arising from Biology
topic Quantitative Methods
url https://arxiv.org/abs/2501.01283