Identifiability

In statistics, identifiability is a property which a model must satisfy in order for precise inference to be possible. We say that the model is identifiable if it is theoretically possible to learn the true values of this model’s underlying parameters after obtaining an infinite number of observations from it. Mathematically, this is equivalent to saying that different values of the parameters must generate different probability distributions of the observable variables. Usually the model is identifiable only under certain technical restrictions, in which case the set of these requirements is called the identification conditions.

A model that fails to be identifiable is said to be non-identifiable or unidentifiable; two or more parametrizations are observationally equivalent. In some cases, even though a model is non-identifiable, it is still possible to learn the true values of a certain subset of the model parameters. In this case we say that the model is partially identifiable. In other cases it may be possible to learn the location of the true parameter up to a certain finite region of the parameter space, in which case the model is set identifiable.

Aside from strictly theoretical exploration of the model properties, identifiability can be referred to in a wider scope when a model is tested with experimental data sets, using identifiability analysis.

Let ${\displaystyle {\mathcal {P}}=\{P_{\theta }:\theta \in \Theta \}}$ be a statistical model where the parameter space ${\displaystyle \Theta }$ is either finite- or infinite-dimensional. We say that ${\displaystyle {\mathcal {P}}}$ is identifiable if the mapping ${\displaystyle \theta \mapsto P_{\theta }}$ is one-to-one:

...
Wikipedia