Why the GMM Weight Matters
GMM chooses parameter values that make a vector of sample moments close to zero. When there are more moment conditions than parameters, there are different ways to measure how far that vector is from zero. The weighting matrix determines which combinations of moments matter most to the criterion, and therefore affects the estimator’s asymptotic precision.
The central result is that, under correct specification and regularity conditions, the most precise fixed-weight GMM estimator uses the inverse long-run covariance matrix of the moments. This choice accounts both for differences in moment variability and for dependence among moments. The result is a covariance comparison: the efficient weight yields an asymptotic covariance matrix no larger than that from any other admissible fixed weight, in the positive-semidefinite sense.
Conditions and the General Covariance Formula
Write the parameter as a \(p\)-dimensional vector, with \(q\geq p\) moment conditions. Correct specification means that there is a true parameter value \(\theta_0\) satisfying \(E[g_i(\theta_0)]=0\). Define the moment Jacobian and the long-run covariance matrix at that value by
For independent observations, the off-diagonal-lag terms in \(\Omega\) are zero, so it is the covariance matrix of one observation’s moments. For dependent observations, it incorporates serial dependence. The earlier material on long-run covariance estimation gives ways to estimate this matrix; here it is treated as the population covariance governing the comparison.
The standard fixed-weight GMM asymptotic result applies when the estimator is consistent for \(\theta_0\), the sample moments satisfy a central limit theorem, the moments are sufficiently smooth near \(\theta_0\), and \(G\) has full column rank. Assume also that \(\Omega\) is finite and positive definite and that \(W\) is symmetric and positive definite. These conditions ensure that the moment variation is nondegenerate and that the local quadratic criterion identifies the parameter.
This formula separates the role of the weight from the role of the data. The matrix \(G\) describes how the expected moments change with the parameter. The matrix \(\Omega\) describes the variability and dependence of the moments. A weight that ignores \(\Omega\) can give excessive influence to noisy moment combinations, or fail to account for correlated combinations.
Why the Inverse Covariance Is Optimal
The covariance comparison can be proved by viewing each fixed-weight estimator’s first-order behavior as a linear combination of the sample moments. For any fixed \(W\), define
Then \(B_WG=I_p\), and the covariance formula is \(V(W)=B_W\Omega B_W'\). The inverse-covariance choice corresponds to
It also satisfies \(B_0G=I_p\). Any other matrix \(B_W\) satisfying that restriction can be written as \(B_W=B_0+D\), where \(DG=0\). Expanding its covariance gives
To see why the cross terms vanish, \(B_0\Omega=(G'\Omega^{-1}G)^{-1}G'\). Thus \(B_0\Omega D'=(G'\Omega^{-1}G)^{-1}(DG)'=0\), and the other cross term is its transpose. Since \(\Omega\) is positive definite, \(D\Omega D'\) is positive semidefinite: for every vector \(a\), \(a'D\Omega D'a=(D'a)'\Omega(D'a)\geq0\). Therefore
This establishes the efficiency result: no fixed-weight GMM estimator satisfying the stated conditions has a smaller asymptotic covariance matrix in any direction than the inverse-covariance estimator. The result concerns asymptotic covariance, not a claim that the efficient estimator must have lower error in every finite sample.
Worked Comparisons
Worked Example: Comparing Identity and Efficient Weights
Suppose a hypothetical model has one parameter and two correctly specified moments. Let the moment Jacobian and long-run covariance be
The covariance matrix is positive definite: its leading diagonal entry is \(4>0\), and its determinant is \(4(2)-1(1)=7>0\). Compare the identity weight \(W=I_2\) with the efficient weight.
For \(W=I_2\), \(G'G=2\) and \(\Omega G=(5,3)'\), so \(G'\Omega G=8\). The scalar asymptotic variance is
The efficient weight is
Multiplying gives \(\Omega^{-1}G=(1/7)(1,3)'\), and hence \(G'\Omega^{-1}G=4/7\). Therefore
The efficient weight reduces asymptotic variance from \(2\) to \(1.750\), a reduction of \(0.250\) in the parameter’s squared units. The off-diagonal entries of \(\Omega^{-1}\) matter here: the efficient weighting accounts for the positive correlation between the two moment contributions rather than treating their information as independent.
Worked Example: Unequal Moment Variances
Consider a hypothetical scalar parameter with two moment conditions, with
The moments are uncorrelated, but the first has variance \(9\), while the second has variance \(1\). With identity weighting, \(G'G=5\) and \(G'\Omega G=9+4=13\). Thus
The inverse covariance is \(\Omega^{-1}=\operatorname{diag}(1/9,1)\). It gives
The inverse-covariance weight scales down the contribution from the highly variable first moment and retains more of the comparatively precise second moment. The resulting asymptotic variance, approximately \(0.2432\) in squared parameter units, is smaller than \(0.5200\).
Worked Example: Why a Scalar Multiple Is Equally Efficient
Return to the first example, where \(G'\Omega^{-1}G=4/7\), and multiply the efficient weight by \(2\): \(W=2\Omega^{-1}\). Then \(G'WG=8/7\). Also,
For a scalar parameter, the sandwich formula becomes
Thus multiplying the efficient weight by \(2\) leaves its asymptotic covariance unchanged. In general, replacing \(W\) by \(cW\), for \(c>0\), multiplies \(G'WG\) by \(c\) and \(G'W\Omega WG\) by \(c^2\); those factors cancel in the sandwich covariance. A positive scalar multiple also leaves the minimizer of the sample criterion unchanged.
What the Result Does—and Does Not—Say
The optimality claim is conditional on correct specification: at \(\theta_0\), all population moments equal zero. It also compares fixed positive-definite weighting matrices under the same moment conditions. It does not say that adding arbitrary moment conditions always improves precision, nor does it establish optimality when the moments are misspecified. Those are different questions.
There is also an important special case. If \(q=p\) and \(G\) is nonsingular, the model is exactly identified. Locally, the estimator solves the \(p\) moment equations, and every nonsingular fixed weight gives the same first-order covariance. Indeed, \(B_WG=I_p\) then forces \(B_W=G^{-1}\). The choice of weight has a distinctive efficiency role when the model is overidentified, with more moments than parameters.
Common Pitfall
- Wrong reasoning: “The efficient weight is the covariance matrix \(\Omega\), because high-variance moments should count more.”
- Correction: The efficient weight is \(\Omega^{-1}\), not \(\Omega\). Inverse weighting reduces the influence of noisy moment directions and accounts for covariance among moments. The claim is about the covariance of the resulting parameter estimator, not about making the sample moments themselves less variable.
- Another error: Comparing only diagonal variances and concluding one matrix is smaller without checking all parameter combinations. Matrix efficiency means the difference in covariance matrices is positive semidefinite; equivalently, every linear combination of parameter estimates has no larger asymptotic variance under the efficient weight.
Check Your Understanding
Use the assumptions and covariance comparison in this tutorial to answer the following.
- What does \(\Omega\) represent when the moment contributions are serially dependent?
- For a fixed positive-definite weight \(W\), write the asymptotic covariance matrix of the GMM estimator.
- Why does the term \(D\Omega D'\) establish that the efficient covariance is no larger than the covariance from another fixed weight?
- In the unequal-variance example, which moment is downweighted by \(\Omega^{-1}\), and why?
- Why do nonsingular fixed weights give the same first-order covariance in an exactly identified model?