Rothenberg (1971)

Identification in Parametric Models

These notes are based on the following article:

Given an observed sample, we want to perform inference about an underlying structure. Identification refers to the question of whether such inference is even possible. Or, under what conditions is it possible?

Rothenberg is interested in conditions for conditions for identification in general parametric models, with rank conditions for linear models presented as a special case. The broader structural identification problem is more general than that of parametric identification. See Koopmans and Reiersøl (1950) for a general formulation.

The conditions laid out are related to the information matrix, which measures the information available from the sample about the parameters. Lack of identification is simply lack of sufficient information to distinguish between different structures.

The results are for unconditional models f(y), but extensions to conditional models f(yx) are straightforward.

Definitions

Let Y n and suppose that the distribution of Y is a member of some family of distribution functions . A structure S is a set of hypotheses which imply a unique distribution F(S). Let 𝒮 be the collection of all structures.

Two structures S and S in 𝒮 are observationally equivalent if they imply the same distribution of Y: F(S)=F(S). A structure S𝒮 is identifiable if there is no other structure S in 𝒮 which is observationally equivalent.

These definitions apply to general sets 𝒮 and , but can be specialized to the case of parametric models. Suppose that every structure in 𝒮 can be described by a real vector α m and let A m be the set of all possible values of α. Now, suppose that the distribution of Y is known to be a continuous density function of the form f(y,α) for some unknown value of α. Let ={f(y,α):αA} be the parametric family of all such functions. We have thus reduced the problem of identifying a general structure to that of identifying a single point in the parameter space A.

We can now redefine the definitions above in terms of a generic parametric model. Two parameters (structures) α and α in A are observationally equivalent if they imply the same distribution of Y: f(y,α)=f(y,α) for all y n. Similarly, a parameter α 0A is identifiable if there is no other parameter α in A which is observationally equivalent.

Rothenberg considers two notions of identification—local and global. Global identification is simply a more precise way of labeling the definition above, that no other α in the entire parameter space is observationally equivalent to α 0. Local identification relaxes this requirement, and only requires there to be some open set containing α 0 over which no other α is observationally equivalent. Clearly, global identification implies local identification.

So, to summarize, the (parametric) identification problem is to find conditions on f(y,α) and A which guarantee that α 0 is identifiable, at least locally, but perhaps globally.

A parametric model is regular if the following conditions hold:

The results that follow are for regular parametric models.

The information matrix is the usual matrix R(α)=[r ij(α)]=E[lnfα ilnfα j].

A point α 0 is a regular point of a matrix M(α) if there exists an open set containing α 0 over which M(α) has constant rank.

Local Identification

Rothenberg’s main result on local identification in regular models is the following.

Theorem: If α 0 is a regular point of the information matrix R(α), then α 0 is locally identifiable if and only if R(α 0) is nonsingular.

Following this is a theorem considering the case where α is known to satisfy a set of constraints of the form ϕ(α)=0.

Global Identification

Proving global identification is harder. Two cases are considered.

A function g(y,α) is a member of the exponential family of densities if it can be written g(y,α)=A(y)+B(α)+ i=1 mα iD i(y) where B(α) is differentiable in α.

Theorem: If f(y,α) is a member of the exponential family and R(α) is nonsingular in a convex set containing A, then every αA is globally identifiable.

Theorem: Suppose there exist m known functions ϕ 1(Y),,ϕ m(Y) such that for all αA, α i=E[ϕ i(Y)] for all i=1,,m. Then every αA is globally identifiable.

References