# Global Identifiability of Differential Models

arXiv: https://arxiv.org/abs/1801.08112 · HTML: https://mlsanity.com/paper/1801.08112/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Jan 2018.

## Built on by (most cited first, 3 of 3)

- [Symbolic Recovery of Differential Equations: The Identifiability Problem](https://mlsanity.com/paper/2210.08342/) (2022)
- [More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability](https://mlsanity.com/paper/2204.01623/) (2022)
- [CBINNS: Cancer Biology-Informed Neural Network for Unknown Parameter Estimation and Missing Physics Identification](https://mlsanity.com/paper/2510.17920/) (2025)

## Abstract (arXiv)

Many real-world processes and phenomena are modeled using systems of ordinary differential equations with parameters. Given such a system, we say that a parameter is globally identifiable if it can be uniquely recovered from input and output data. The main contribution of this paper is to provide theory, an algorithm, and software for deciding global identifiability. First, we rigorously derive an algebraic criterion for global identifiability (this is an analytic property), which yields a deterministic algorithm. Second, we improve the efficiency by randomizing the algorithm while guaranteeing the probability of correctness. With our new algorithm, we can tackle problems that could not be tackled before. A software based on the algorithm (called SIAN) is available at https://github.com/pogudingleb/SIAN.
