Overview
In statistics, identifiability is a property which a model must satisfy for precise inference to be possible. A 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.
Definition
Let \mathcal P =\ P_\theta:\theta\in\Theta\ be a statistical model with parameter space \Theta . We say that \mathcal P is identifiable if the mapping \theta\mapsto P_\theta is one-to-one: : P_ \theta_1 =P_ \theta_2 \quad\Rightarrow\quad \theta_1=\theta_2 \quad\ \text for all \theta_1,\theta_2\in\Theta. This definition means that distinct values of θ should correspond to distinct probability distributions: if θ 1 ≠θ 2 , then also P θ 1 ≠P θ 2 . If the distributions are defined in terms of the probability density functions (pdfs), then two pdfs should be considered distinct only if they differ on a set of non-zero measure (for example two functions ƒ 1 (x) = 1 0 ≤ x and ƒ 2 (x) = 1 0 ≤ x ≤ 1 differ only at a single point x = 1 — a set of measure zero — and thus cannot be considered as distinct pdfs).
Identifiability of the model in the sense of invertibility of the map \theta\mapsto P_\theta is equivalent to being able to learn the model's true parameter if the model can be observed indefinitely long. Indeed, if X t ⊆ S is the sequence of observations from the model, then by the strong law of large numbers, : \frac 1 T \sum_ t=1 ^T \mathbf 1 _ \ X_t\in A\ \ \xrightarrow \text a.s. \ \Pr X_t\in A , for every measurable set A ⊆ S (here 1 ... is the indicator function). Thus, with an infinite number of observations we will be able to find the true probability distribution P 0 in the model, and since the identifiability condition above requires that the map \theta\mapsto P_\theta be invertible, we will also be able to find the true value of the parameter which generated given distribution P 0 .
Example 1
Let \mathcal P be the normal location-scale family: : \mathcal P = \Big\ \ f_\theta(x) = \tfrac 1 \sqrt 2\pi \sigma e^ -\frac 1 2\sigma^2 (x-\mu)^2 \ \Big \ \theta=(\mu,\sigma): \mu\in\mathbb R , \,\sigma\!>0 \ \Big\ .
Then : \begin align & f_ \theta_1 (x)=f_ \theta_2 (x) \\ 6pt \Longleftrightarrow & \frac 1 \sqrt 2\pi \sigma_1 \exp\left( -\frac 1 2\sigma_1^2 (x-\mu_1)^2 \right) = \frac 1 \sqrt 2\pi \sigma_2 \exp\left( -\frac 1 2\sigma_2^2 (x-\mu_2)^2 \right) \\ 6pt \Longleftrightarrow & \frac 1 \sigma_1^2 (x-\mu_1)^2 + \ln \sigma_1 = \frac 1 \sigma_2^2 (x-\mu_2)^2 + \ln \sigma_2 \\ 6pt \Longleftrightarrow & x^2 \left(\frac 1 \sigma_1^2 -\frac 1 \sigma_2^2 \right) - 2x\left(\frac \mu_1 \sigma_1^2 -\frac \mu_2 \sigma_2^2 \right) + \left(\frac \mu_1^2 \sigma_1^2 -\frac \mu_2^2 \sigma_2^2 +\ln\sigma_1-\ln\sigma_2\right) = 0 \end align This expression is equal to zero for almost all x only when all its coefficients are equal to zero, which is only possible when σ 1 = σ 2 and μ 1 = μ 2 .
Since in the scale parameter σ is restricted to be greater than zero, we conclude that the model is identifiable: ƒ θ 1 = ƒ θ 2 ⇔ θ 1 = θ 2 .
Example 2
Let \mathcal P be the standard linear regression model: : y = \beta'x + \varepsilon, \quad \mathrm E \,\varepsilon\mid x\, =0 (where ′ denotes matrix transpose). Then the parameter β is identifiable if and only if the matrix \mathrm E xx' is invertible. Thus, this is the identification condition in the model.
Example 3
Suppose \mathcal P is the classical errors-in-variables linear model: : \begin cases y = \beta x^* + \varepsilon, \\ x = x^* + \eta, \end cases where (ε,η,x*) are jointly normal independent random variables with zero expected value and unknown variances, and only the variables (x,y) are observed. Then this model is not identifiable, only the product βσ² ∗ is (where σ² ∗ is the variance of the latent regressor x*). This is also an example of a set identifiable model: although the exact value of β cannot be learned, we can guarantee that it must lie somewhere in the interval (β yx , 1÷β xy ), where β yx is the coefficient in OLS regression of y on x, and β xy is the coefficient in OLS regression of x on y.
If we abandon the normality assumption and require that x* were not normally distributed, retaining only the independence condition ε ⊥ η ⊥ x*, then the model becomes identifiable.
See also
* System identification * Structural identifiability * Observability * Simultaneous equations model