More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability

2022/04/04 by Ilmer, Ilia, Ovchinnikov, Alexey, Pogudin, Gleb +1 · 1 citation
#Algebraic Geometry (math.AG) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Symbolic Computation (cs.SC)

paper · doi:10.48550/arxiv.2204.01623

Abstract

Structural global parameter identifiability indicates whether one can determine a parameter's value from given inputs and outputs in the absence of noise. If a given model has parameters for which there may be infinitely many values, such parameters are called non-identifiable. We present a procedure for accelerating a global identifiability query by eliminating algebraically independent non-identifiable parameters. Our proposed approach significantly improves performance across different computer algebra frameworks.

Cited by

• Simple generators of rational function fields

Related

• Computing all identifiable functions of parameters for ODE models
• Algorithm to find new identifiable reparametrizations of parametric rational ODE models
• Identifiable specializations for ODE models
• Multi-experiment parameter identifiability of ODEs and model theory
• Examining the impact of forcing function inputs on structural identifiability