Sensitivity, robustness and identifiability in stochastic chemical kinetics models
Michal Komorowski, Maria J. Costa, David A. Rand, Michael Stumpf

TL;DR
This paper introduces a novel numerical method to compute Fisher Information Matrices for stochastic chemical kinetics models using the linear noise approximation, enabling sensitivity and identifiability analysis without Monte Carlo simulations.
Contribution
The authors develop the first efficient method to calculate Fisher Information for stochastic chemical kinetics models directly from differential equations, bypassing simulation-based approaches.
Findings
Significant differences between stochastic and deterministic models identified.
Variability and correlations impact parameter sensitivity and robustness.
Method facilitates experimental design for cellular stochastic processes.
Abstract
We present a novel and simple method to numerically calculate Fisher Information Matrices for stochastic chemical kinetics models. The linear noise approximation is used to derive model equations and a likelihood function which leads to an efficient computational algorithm. Our approach reduces the problem of calculating the Fisher Information Matrix to solving a set of ordinary differential equations. {This is the first method to compute Fisher Information for stochastic chemical kinetics models without the need for Monte Carlo simulations.} This methodology is then used to study sensitivity, robustness and parameter identifiability in stochastic chemical kinetics models. We show that significant differences exist between stochastic and deterministic models as well as between stochastic models with time-series and time-point measurements. We demonstrate that these discrepancies arise…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
