{
  "id": "generalized-method-of-moments",
  "title": "Generalized Method of Moments",
  "lang": "en",
  "source_lang": "en",
  "summary": "The generalized method of moments estimates model parameters by minimizing a weighted measure of discrepancies between theoretical moment conditions and their sample counterparts.",
  "category": "mathematics",
  "subcategory": "probability-statistics",
  "type": "concept",
  "aliases": [
    "GMM",
    "generalized method of moments estimation"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/generalized-method-of-moments/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/generalized-method-of-moments/",
      "json": "https://aiwiki.page/zh/generalized-method-of-moments.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The generalized method of moments (GMM) is a framework for estimating parameters from restrictions on the expected values of functions of observed data. Rather than requiring a complete specification of the data’s probability distribution, GMM uses moment conditions that should hold at the true parameter values and selects estimates that make their sample counterparts as close to zero as possible. It generalizes the method of moments by allowing more moment conditions than unknown parameters and by weighting those conditions according to their statistical precision and dependence. GMM is widely used in econometrics, especially for instrumental-variable models, dynamic models, and economic models defined by equilibrium or optimality conditions."
    },
    {
      "heading": "Moment conditions and the estimator",
      "text": "Let \\(Z_i\\) denote the observed data for observation \\(i\\), let \\(\\theta_0\\in\\Theta\\subseteq\\mathbb R^p\\) be the true parameter vector, and let \\(g(Z_i,\\theta)\\) be a vector of \\(q\\) known functions. The model supplies the population restrictions\n\n\\[\\mathbb E[g(Z_i,\\theta_0)]=0.\\]\n\nThe components of \\(g\\) are called moment functions. Although the term “moment” often refers to expectations of powers, such as means and second moments, GMM also accommodates expectations of much more general functions.\n\nFor a sample of size \\(n\\), define\n\n\\[\\bar g_n(\\theta)=\\frac{1}{n}\\sum_{i=1}^{n}g(Z_i,\\theta).\\]\n\nThe GMM estimator is\n\n\\[\\hat\\theta_n = \\underset{\\theta\\in\\Theta}{\\operatorname{argmin}} \\;Q_n(\\theta), \\qquad Q_n(\\theta)= \\bar g_n(\\theta)^\\top W_n\\bar g_n(\\theta),\\]\n\nwhere \\(W_n\\) is a symmetric positive-definite weighting matrix. The transpose symbol \\({}^\\top\\) converts the vector of sample moments into a scalar quadratic form.\n\nThe criterion measures a weighted distance between the sample moments and zero. Its minimization is a problem in mathematical optimization. Depending on the moment functions, it may admit a closed-form solution or require numerical methods.\n\nIdentification\n\nMoment conditions identify a parameter when they distinguish it from other possible parameter values. A standard global identification requirement is\n\n\\[\\mathbb E[g(Z_i,\\theta)]=0 \\quad\\Longleftrightarrow\\quad \\theta=\\theta_0.\\]\n\nFor regular local identification, the \\(q\\times p\\) derivative matrix\n\n\\[G= \\mathbb E\\left[ \\frac{\\partial g(Z_i,\\theta_0)}{\\partial\\theta^\\top} \\right]\\]\n\nmust have full column rank \\(p\\). This condition requires at least as many moment conditions as parameters, although counting conditions alone does not establish identification.\n\n- Exactly identified: \\(q=p\\). If the sample moment equations have a unique solution, that solution minimizes the criterion at zero regardless of the positive-definite weighting matrix.\n- Overidentified: \\(q>p\\). The sample moment equations generally cannot all be satisfied exactly, so the weighting matrix determines how their discrepancies are balanced.\n- Underidentified in the regular rank sense: \\(q<p\\). The derivative matrix cannot have full column rank, and the usual regular GMM theory does not apply.\n\nNonlinear models can have identification features not captured by simple equation counting. Global uniqueness and local rank therefore serve distinct purposes."
    },
    {
      "heading": "Relationship to other estimation methods",
      "text": "Ordinary method of moments\n\nThe ordinary method of moments commonly estimates \\(p\\) parameters by equating \\(p\\) theoretical moments to their sample analogues. For example, a distribution with unknown mean and variance may be estimated using the first two sample moments.\n\nGMM permits additional valid restrictions. Rather than choosing an arbitrary subset of them, it combines all selected moments through a weighted criterion. Ordinary method-of-moments estimation is therefore a special case.\n\nLeast squares and instrumental variables\n\nFor a linear regression model\n\n\\[y_i=x_i^\\top\\beta_0+u_i,\\]\n\nsuppose \\(z_i\\) is a vector of instruments satisfying\n\n\\[\\mathbb E[z_i u_i]=0.\\]\n\nThe moment function is\n\n\\[g(Z_i,\\beta)=z_i(y_i-x_i^\\top\\beta).\\]\n\nThese are the orthogonality conditions underlying instrumental-variable estimation. Instruments are useful when regressors are correlated with the disturbance, a form of endogeneity that invalidates the usual least-squares moment conditions.\n\nWith \\(z_i=x_i\\), the sample equations become\n\n\\[\\frac{1}{n}\\sum_{i=1}^{n} x_i(y_i-x_i^\\top\\beta)=0,\\]\n\nwhich are the normal equations for ordinary least squares, provided the regressor matrix has full column rank.\n\nMore generally, let \\(X\\) be the regressor matrix, \\(Z\\) the instrument matrix, and \\(y\\) the outcome vector. For a fixed weighting matrix, linear GMM gives\n\n\\[\\hat\\beta= (X^\\top ZW_nZ^\\top X)^{-1} X^\\top ZW_nZ^\\top y,\\]\n\nwhen the required inverse exists. Choosing \\(W_n\\) proportional to \\((Z^\\top Z)^{-1}\\) produces two-stage least squares. Other weights can improve asymptotic efficiency when the disturbances have nonconstant variance or dependence.\n\nMaximum likelihood\n\nMaximum likelihood estimation uses a specified probability model and its likelihood. GMM generally requires only selected expectation restrictions.\n\nUnder regularity conditions, the likelihood score has expectation zero at the true parameter. Score equations can therefore be treated as moment equations, and a unique interior maximum-likelihood solution may be represented as an exactly identified GMM solution.\n\nThis connection does not imply that an arbitrary GMM estimator is as efficient as maximum likelihood. A correctly specified likelihood may contain information not captured by the selected moments. Conversely, correctly specified moment restrictions can remain valid when some other aspects of a proposed likelihood are incorrect."
    },
    {
      "heading": "Weighting and asymptotic efficiency",
      "text": "The weighting matrix controls how GMM combines the moments. Equal weighting is simple but need not be statistically efficient: moment conditions may have very different variances and may be strongly correlated.\n\nSuppose\n\n\\[\\sqrt n\\,\\bar g_n(\\theta_0) \\xrightarrow{d} N(0,S),\\]\n\nwhere \\(S\\) is the limiting covariance matrix of the scaled sample moments. If \\(W_n\\) converges in probability to a positive-definite matrix \\(W\\), regularity conditions yield\n\n\\[\\sqrt n(\\hat\\theta_n-\\theta_0) \\xrightarrow{d} N(0,V_W),\\]\n\nwith\n\n\\[V_W= (G^\\top WG)^{-1} G^\\top WSWG (G^\\top WG)^{-1}.\\]\n\nThis result follows from a local expansion of the sample moments and a suitable central limit theorem. Consistency additionally requires identification, appropriate convergence of the sample criterion, and conditions ensuring that the minimizer behaves regularly.\n\nFor a fixed set of valid moment conditions, the asymptotically efficient choice is\n\n\\[W=S^{-1},\\]\n\ngiving\n\n\\[V_{\\mathrm{eff}}=(G^\\top S^{-1}G)^{-1}.\\]\n\nEfficiency here is relative to regular GMM estimators using the specified moments. It does not automatically establish efficiency relative to every estimator that could use the data.\n\nIndependent and dependent observations\n\nFor independent, identically distributed observations,\n\n\\[S=\\mathbb E[g(Z_i,\\theta_0)g(Z_i,\\theta_0)^\\top],\\]\n\nbecause the moment vector has mean zero.\n\nFor time-series data, dependence across observations must also be accounted for. Under suitable stationarity and dependence conditions,\n\n\\[S= \\sum_{k=-\\infty}^{\\infty} \\operatorname{Cov} \\bigl(g(Z_t,\\theta_0),g(Z_{t-k},\\theta_0)\\bigr).\\]\n\nThis is a long-run covariance matrix. Estimation commonly uses a heteroskedasticity- and autocorrelation-consistent covariance estimator. With clustered data, the covariance calculation instead accommodates dependence within clusters under an appropriate cluster asymptotic framework.\n\nA covariance estimator must match the dependence structure. Accounting for unequal variances alone does not address serial correlation or clustering."
    },
    {
      "heading": "Practical estimation procedures",
      "text": "One-step and two-step GMM\n\nOne-step GMM uses a prespecified weighting matrix, such as the identity matrix or another convenient positive-definite choice. With valid identification and suitable regularity conditions, it can be a consistent estimator even when its weighting is inefficient.\n\nTwo-step GMM proceeds as follows:\n\n- Obtain a preliminary consistent estimate \\(\\tilde\\theta\\).\n- Estimate \\(S\\) using moment functions evaluated at \\(\\tilde\\theta\\).\n- Re-estimate the parameters using \\(W_n=\\hat S^{-1}\\).\n\nThe second-stage estimator is asymptotically efficient for the chosen moment set if \\(\\hat S\\) consistently estimates \\(S\\).\n\nIterated GMM repeats covariance estimation and parameter estimation until a stopping rule is satisfied. It shares the same first-order asymptotic distribution as efficient two-step GMM under standard conditions, although its finite-sample behavior can differ.\n\nContinuously updated GMM\n\nThe continuously updated estimator allows the covariance estimate to vary with the candidate parameter:\n\n\\[\\hat\\theta_{\\mathrm{CUE}} = \\underset{\\theta\\in\\Theta}{\\operatorname{argmin}} \\; \\bar g_n(\\theta)^\\top \\hat S(\\theta)^{-1} \\bar g_n(\\theta).\\]\n\nUnlike two-step GMM, it does not hold the estimated weighting matrix fixed during the final minimization. This can change higher-order and finite-sample properties, but it also makes the optimization more demanding. It is not uniformly superior across models and sample sizes.\n\nNumerical considerations\n\nPoorly scaled moments, nearly redundant restrictions, and an ill-conditioned covariance estimate can impair numerical stability. Nonlinear criteria may also have multiple local minima or flat regions.\n\nAnalytic derivatives, automatic differentiation, suitable parameterizations, and checks using multiple starting values can help evaluate numerical solutions. A small objective value alone does not establish identification or substantive model validity."
    },
    {
      "heading": "Statistical inference and specification testing",
      "text": "Estimated asymptotic covariance matrices support standard errors, confidence intervals, and parameter tests. If \\(\\hat V\\) estimates the covariance of \\(\\sqrt n(\\hat\\theta-\\theta_0)\\), the approximate covariance of \\(\\hat\\theta\\) is \\(\\hat V/n\\).\n\nThe Hansen J test\n\nIn an overidentified model, efficient GMM also provides a test of whether all selected moment restrictions are jointly compatible with the data. The statistic is\n\n\\[J_n= n\\,\\bar g_n(\\hat\\theta)^\\top \\hat S^{-1} \\bar g_n(\\hat\\theta).\\]\n\nUnder correct specification and the usual regularity and rank conditions,\n\n\\[J_n\\xrightarrow{d}\\chi^2_{q-p}.\\]\n\nThe reference chi-squared distribution has \\(q-p\\) degrees of freedom, representing the restrictions remaining after parameter estimation.\n\nThe test concerns the joint validity of the moment restrictions and the maintained model structure. Rejection does not identify which instrument or assumption is responsible. Non-rejection does not establish that every instrument is valid: the test may have low power, particularly with weak identification or many instruments. In an exactly identified model with a sample moment solution, there are no overidentifying restrictions to test."
    },
    {
      "heading": "Applications",
      "text": "GMM is particularly useful when theory specifies expectations more naturally than complete probability distributions.\n\n- Instrumental-variable models: Orthogonality restrictions connect instruments to structural disturbances.\n- Dynamic panel models: Lagged observations can supply instruments for equations containing lagged dependent variables, subject to specific assumptions about disturbances and initial conditions.\n- Asset pricing: Pricing equations imply restrictions such as\n\n\\[\\mathbb E[m_{t+1}(\\theta)R_{t+1}-1]=0,\\]\n\nwhere \\(m_{t+1}\\) is a stochastic discount factor and \\(R_{t+1}\\) is a gross return.\n- Structural economic models: First-order conditions and equilibrium restrictions generate moments without requiring a complete likelihood.\n- Conditional moment models: Restrictions of the form\n\n\\[\\mathbb E[u_i(\\theta_0)\\mid z_i]=0\\]\n\nimply unconditional moments\n\n\\[\\mathbb E[h(z_i)u_i(\\theta_0)]=0\\]\n\nfor suitable instrument functions \\(h\\). This construction uses properties of conditional expectation.\n\nA finite collection of unconditional moments generally captures only part of a conditional restriction. Choosing instrument functions therefore affects both information content and estimator performance."
    },
    {
      "heading": "Limitations and qualifications",
      "text": "Weak identification. When moments change only slightly with the parameters, the derivative matrix may be nearly rank-deficient. Conventional normal approximations and parameter tests can then be unreliable, even in fairly large samples.\n\nMany moments or instruments. Adding valid moments can improve population efficiency, but estimating a large covariance matrix introduces sampling noise. Numerous instruments can increase finite-sample bias and weaken the usefulness of specification tests. Standard fixed-dimension asymptotic formulas need not remain valid when the number of moments grows with sample size.\n\nInvalid moments. GMM does not correct incorrect identifying assumptions. If no parameter satisfies all population restrictions, the estimator generally converges to a criterion-minimizing pseudo-true value. That value can depend on the weighting scheme, and conventional correctly specified covariance formulas may fail.\n\nFinite-sample uncertainty. Asymptotic efficiency does not guarantee small finite-sample error. In particular, conventional two-step standard errors can understate uncertainty in some dynamic panel applications; specialized finite-sample corrections have been developed for such settings.\n\nDistributional robustness is limited. Avoiding a fully specified likelihood does not make GMM insensitive to outliers, heavy tails, or dependence. Required expectations may fail to exist, and the laws of large numbers or central limit theorems needed for conventional inference may not apply."
    },
    {
      "heading": "Historical development",
      "text": "The method of moments predates GMM, as do least-squares and instrumental-variable methods that can be represented within its framework. The modern general formulation is associated with Lars Peter Hansen’s 1982 paper, Large Sample Properties of Generalized Method of Moments Estimators. It established a unified large-sample theory for estimation from moment restrictions, including dependent observations, optimal weighting, and tests of overidentifying restrictions.\n\nLater developments extended the framework to dynamic panels, simulated moments, conditional restrictions, alternative updating schemes, and settings with weak or numerous instruments. These extensions differ principally in how they construct moments, estimate their covariance, and handle departures from conventional fixed-dimensional asymptotic assumptions."
    }
  ],
  "links": [
    "expected-value",
    "probability-distribution",
    "econometrics",
    "positive-definite-matrix",
    "quadratic-form",
    "mathematical-optimization",
    "statistical-identification",
    "matrix-rank",
    "linear-regression",
    "instrumental-variables",
    "endogeneity",
    "ordinary-least-squares",
    "maximum-likelihood-estimation",
    "covariance-matrix",
    "central-limit-theorem",
    "time-series",
    "consistent-estimator",
    "numerical-stability",
    "automatic-differentiation",
    "standard-error",
    "confidence-interval",
    "chi-squared-distribution",
    "degrees-of-freedom",
    "conditional-expectation",
    "estimator-bias"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}