Generalized Method of Moments (GMM)

Graduate Depth 87 in the knowledge graph I know this Set as goal
estimation gmm moment-conditions

Core Idea

GMM exploits moment conditions E[f(Yᵢ, θ)] = 0 to estimate θ by minimizing a quadratic form in sample moments. It generalizes OLS, IV, and MLE; yields efficient estimators when moment conditions are correctly specified. The Hansen J-test checks overidentification.

Explainer

You've encountered several estimation strategies already: OLS minimizes squared residuals, MLE maximizes the likelihood of the observed data, and IV uses instruments to isolate exogenous variation. GMM unifies all of these into a single framework built around the idea of moment conditions. A moment condition is a population statement of the form E[f(Yᵢ, θ)] = 0, where f is some function of the data and the parameters, and the expectation equals zero when evaluated at the true θ. OLS, for example, rests on the moment condition E[Xᵢ(Yᵢ - Xᵢ'β)] = 0 — the orthogonality of regressors and errors. IV adds the instrument orthogonality condition E[Zᵢ(Yᵢ - Xᵢ'β)] = 0. Both are special cases of the GMM framework.

The GMM estimator works by replacing the population expectation E[f(Yᵢ, θ)] with its sample analog (1/n)Σf(Yᵢ, θ), then choosing θ to make this sample moment vector as close to zero as possible. When you have exactly as many moment conditions as parameters — just-identified — you can set the sample moments exactly to zero and solve directly. This gives the IV estimator as a special case. When you have more moment conditions than parameters — overidentified — you can't satisfy all moments simultaneously, so you minimize a weighted sum of squared moments: the GMM objective function g(θ)'Wg(θ), where g(θ) is the vector of sample moments and W is a weighting matrix.

The choice of W matters enormously for efficiency. The optimal weighting matrix is the inverse of the variance of the moment conditions — intuitively, you should downweight moments that are noisy and upweight those that are precisely estimated. Implementing this requires two-step GMM: estimate θ with an initial W (often the identity matrix), compute the sample variance of the moments at those estimates, invert it to get the optimal W, and re-estimate. The resulting two-step GMM estimator is asymptotically efficient among all GMM estimators using those moment conditions.

Overidentification creates a testable restriction: if the model is correctly specified, all the moment conditions should hold simultaneously. The Hansen J-statistic measures how well the overidentifying restrictions are satisfied at the GMM estimates. A large J-statistic — relative to a chi-squared distribution with degrees of freedom equal to the number of overidentifying restrictions — suggests at least one moment condition is misspecified, meaning some instruments may be invalid or the functional form is wrong. Passing the J-test is necessary but not sufficient for validity; failing it is a clear signal of misspecification. In practice, GMM is particularly useful in rational expectations models (where theory delivers moment conditions directly) and in dynamic panel models where the Arellano-Bond estimator uses lagged levels as instruments for differenced equations.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIndefinite IntegralsBasic Integration RulesRiemann SumsDefinite Integral DefinitionProbability Density Functions and Continuous DistributionsCumulative Distribution FunctionsContinuous Random VariablesNormal DistributionCentral Limit TheoremConfidence Intervals for MeansZ-Tests and T-Tests for MeansOne-Sample Z-Test for MeansOne-Sample and Two-Sample T-TestsOne-Way ANOVAF-Test and Joint SignificanceR-Squared and Model FitOmitted Variable BiasCausal Inference and the Identification ProblemPotential Outcomes and the Rubin Causal ModelSelection BiasInstrumental VariablesGeneralized Method of Moments (GMM)

Longest path: 88 steps · 488 total prerequisite topics

Prerequisites (5)

Leads To (0)

No topics depend on this one yet.