Algorithm to find new identifiable reparametrizations of parametric rational ODE models
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912421018337280 |
|---|---|
| author | Meshkat, Nicolette Ovchinnikov, Alexey Scanlon, Thomas |
| author_facet | Meshkat, Nicolette Ovchinnikov, Alexey Scanlon, Thomas |
| contents | Structural identifiability concerns the question of which unknown parameters of a model can be recovered from (perfect) input-output data. If all of the parameters of a model can be recovered from data, the model is said to be identifiable. However, in many models, there are parameters that can take on an infinite number of values but yield the same input-output data. In this case, those parameters and the model are called unidentifiable. The question is then what to do with an unidentifiable model. One can try to add more input-output data or decrease the number of unknown parameters, if experimentally feasible, or try to find a reparametrization to make the model identifiable. In this paper, we take the latter approach. While existing approaches to find identifiable reparametrizations were limited to scaling reparametrizations or were not guaranteed to find a globally identifiable reparametrization even if it exists, we significantly broaden the class of models for which we can find a globally identifiable model with the same input-output behavior as the original one. We also prove that, for linear models, a globally identifiable reparametrization always exists and show that, for a certain class of linear compartmental models, with and without inputs, an explicit reparametrization formula exists. We illustrate our method on several examples and provide detailed analysis in supplementary material on github. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_03057 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Algorithm to find new identifiable reparametrizations of parametric rational ODE models Meshkat, Nicolette Ovchinnikov, Alexey Scanlon, Thomas Systems and Control Algebraic Geometry Dynamical Systems Quantitative Methods 92B05, 93C15, 93B25, 93B30, 34A55, 12H05, 03C40, 03C60 Structural identifiability concerns the question of which unknown parameters of a model can be recovered from (perfect) input-output data. If all of the parameters of a model can be recovered from data, the model is said to be identifiable. However, in many models, there are parameters that can take on an infinite number of values but yield the same input-output data. In this case, those parameters and the model are called unidentifiable. The question is then what to do with an unidentifiable model. One can try to add more input-output data or decrease the number of unknown parameters, if experimentally feasible, or try to find a reparametrization to make the model identifiable. In this paper, we take the latter approach. While existing approaches to find identifiable reparametrizations were limited to scaling reparametrizations or were not guaranteed to find a globally identifiable reparametrization even if it exists, we significantly broaden the class of models for which we can find a globally identifiable model with the same input-output behavior as the original one. We also prove that, for linear models, a globally identifiable reparametrization always exists and show that, for a certain class of linear compartmental models, with and without inputs, an explicit reparametrization formula exists. We illustrate our method on several examples and provide detailed analysis in supplementary material on github. |
| title | Algorithm to find new identifiable reparametrizations of parametric rational ODE models |
| topic | Systems and Control Algebraic Geometry Dynamical Systems Quantitative Methods 92B05, 93C15, 93B25, 93B30, 34A55, 12H05, 03C40, 03C60 |
| url | https://arxiv.org/abs/2310.03057 |