2000 character limit reached
More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability (2204.01623v1)
Published 4 Apr 2022 in cs.SC, cs.LG, and math.AG
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.