Learn R Programming

gmm (version 1.3-8)

gmm: Generalized method of moment estimation

Description

Function to estimate a vector of parameters based on moment conditions using the GMM method of Hansen(82).

Usage

gmm(g, x, t0 = NULL, gradv = NULL, type = c("twoStep","cue","iterative"), 
wmatrix = c("optimal","ident"), vcov = c("HAC","iid","TrueFixed"), 
kernel = c("Quadratic Spectral","Truncated", "Bartlett", 
"Parzen", "Tukey-Hanning"), crit = 10e-7, bw = bwAndrews, 
prewhite = FALSE, ar.method = "ols", approx = "AR(1)", tol = 1e-7, 
itermax = 100, optfct = c("optim","optimize","nlminb"), model=TRUE, X=FALSE, Y=FALSE, 
TypeGmm = "baseGmm", centeredVcov = TRUE, weightsMatrix = NULL, data,  ...)

Arguments

g
A function of the form $g(\theta,x)$ and which returns a $n \times q$ matrix with typical element $g_i(\theta,x_t)$ for $i=1,...q$ and $t=1,...,n$. This matrix is then used to build the q sample moment conditions. It can also be a formula if the model is
x
The matrix or vector of data from which the function $g(\theta,x)$ is computed. If "g" is a formula, it is an $n \times Nh$ matrix of instruments or a formula (see details below).
t0
A $k \times 1$ vector of starting values. It is required only when "g" is a function because only then a numerical algorithm is used to minimize the objective function. If the dimension of $\theta$ is one, see the argument "optfct".
gradv
A function of the form $G(\theta,x)$ which returns a $q\times k$ matrix of derivatives of $\bar{g}(\theta)$ with respect to $\theta$. By default, the numerical algorithm numericDeriv is used. It is of course strongly suggested to provide this
type
The GMM method: "twostep" is the two step GMM proposed by Hansen(1982) and the "cue" and "iterative" are respectively the continuous updated and the iterative GMM proposed by Hansen, Eaton et Yaron (1996)
wmatrix
Which weighting matrix should be used in the objective function. By default, it is the inverse of the covariance matrix of $g(\theta,x)$. The other choice is the identity matrix which is usually used to obtain a first step estimate of $\theta$
vcov
Assumption on the properties of the random vector x. By default, x is a weakly dependant process. The "iid" option will avoid using the HAC matrix which will accelerate the estimation if one is ready to make that assumption. The option "TrueFixed" is used
kernel
type of kernel used to compute the covariance matrix of the vector of sample moment conditions (see kernHAC for more details)
crit
The stoping rule for the iterative GMM. It can be reduce to increase the precision.
bw
The method to compute the bandwidth parameter. By default it is bwAndrews which is proposed by Andrews (1991). The alternative is bwNeweyWest of Newey-
prewhite
logical or integer. Should the estimating functions be prewhitened? If TRUE or greater than 0 a VAR model of order as.integer(prewhite) is fitted via ar with method "ols" and demean = FALSE.
ar.method
character. The method argument passed to ar for prewhitening.
approx
A character specifying the approximation method if the bandwidth has to be chosen by bwAndrews.
tol
Weights that exceed tol are used for computing the covariance matrix, all other weights are treated as 0.
itermax
The maximum number of iterations for the iterative GMM. It is unlikely that the algorithm does not converge but we keep it as a safety.
optfct
Only when the dimension of $\theta$ is 1, you can choose between the algorithm optim or optimize. In that case, the former is unreliable. If
model, X, Y
logicals. If TRUE the corresponding components of the fit (the model frame, the model matrix, the response) are returned if g is a formula.
TypeGmm
The name of the class object created by the method getModel. It allows developers to extand the package and create other GMM methods.
centeredVcov
Should the moment function be centered when computing its covariance matrix. Doing so may improve inference.
weightsMatrix
It allows users to provide gmm with a fixed weighting matrix. This matrix must be $q \times q$, symmetric and strictly positive definite. When provided, the type option becomes irrelevant.
data
A data.frame or a matrix with column names (Optionnal).
...
More options to give to optim.

Value

  • 'gmm' returns an object of 'class' '"gmm"'

    The functions 'summary' is used to obtain and print a summary of the results. It also compute the J-test of overidentying restriction

    The object of class "gmm" is a list containing at least:

  • coefficients$k\times 1$ vector of coefficients
  • residualsthe residuals, that is response minus fitted values if "g" is a formula.
  • fitted.valuesthe fitted mean values if "g" is a formula.
  • vcovthe covariance matrix of the coefficients
  • objectivethe value of the objective function $\| var(\bar{g})^{-1/2}\bar{g}\|^2$
  • termsthe terms object used when g is a formula.
  • callthe matched call.
  • yif requested, the response used (if "g" is a formula).
  • xif requested, the model matrix used if "g" is a formula or the data if "g" is a function.
  • modelif requested (the default), the model frame used if "g" is a formula.
  • algoInfoInformation produced by either optim or nlminb related to the convergence if "g" is a function. It is printed by the summary.gmm method.

Details

If we want to estimate a model like $Y_t = \theta_1 + X_{2t} \theta_2 + \cdots + X_{k}\theta_k + \epsilon_t$ using the moment conditions $Cov(\epsilon_tH_t)=0$, where $H_t$ is a vector of $Nh$ instruments, than we can define "g" like we do for lm. We would have $g = y ~\tilde{}~ x2+x3+ \cdots +xk$ and the argument "x" above would become the matrix H of instruments. As for lm, $Y_t$ can be a $Ny \times 1$ vector which would imply that $k=Nh \times Ny$. The intercept is included by default so you do not have to add a column of ones to the matrix $H$. You do not need to provide the gradiant in that case since in that case it is embedded in gmm. The intercept can be removed by adding -1 to the formula. In that case, the column of ones need to be added manually to H. It is also possible to express "x" as a formula. For example, if the instruments are ${1,z_1,z_2,z_3}$, we can set "x" to $\tilde{} z1+z2+z3$. By default, a column of ones is added. To remove it, set "x" to $\tilde{}z1+z2+z3-1$.

The following explains the last example bellow. Thanks to Dieter Rozenich, a student from the Vienna Universtiy of Economics and Business Administration. He suggested that it would help to understand the implementation of the jacobian.

For the two parameters of a normal distribution $(\mu,\sigma)$ we have the following three moment conditions: $$m_{1} = \mu - x_{i}$$ $$m_{2} = \sigma^2 - (x_{i}-\mu)^2$$ $$m_{3} = x_{i}^{3} - \mu (\mu^2+3\sigma^{2})$$ $m_{1},m_{2}$ can be directly obtained by the definition of $(\mu,\sigma)$. The third moment condition comes from the third derivative of the moment generating function (MGF)

$$M_{X}(t) = exp\Big(\mu t + \frac{\sigma^{2}t^{2}}{2}\Big)$$

evaluated at $(t=0)$.

Note that we have more equations (3) than unknown parameters (2).

The Jacobian of these two conditions is (it should be an array but I can't make it work):

$$1~~~~~~~~~~ 0$$ $$-2\mu+2x ~~~~~ 2\sigma$$ $$-3\mu^{2}-3\sigma^{2} ~~~~ -6\mu\sigma$$

References

Zeileis A (2006), Object-oriented Computation of Sandwich Estimators. Journal of Statistical Software, 16(9), 1--16. URL http://www.jstatsoft.org/v16/i09/.

Pierre Chausse (2010), Computing Generalized Method of Moments and Generalized Empirical Likelihood with R. Journal of Statistical Software, 34(11), 1--35. URL http://www.jstatsoft.org/v34/i11/.

Andrews DWK (1991), Heteroskedasticity and Autocorrelation Consistent Covariance Matrix Estimation. Econometrica, 59, 817--858.

Newey WK & West KD (1987), A Simple, Positive Semi-Definite, Heteroskedasticity and Autocorrelation Consistent Covariance Matrix. Econometrica, 55, 703--708.

Newey WK & West KD (1994), Automatic Lag Selection in Covariance Matrix Estimation. Review of Economic Studies, 61, 631-653.

Hansen, L.P. (1982), Large Sample Properties of Generalized Method of Moments Estimators. Econometrica, 50, 1029-1054,

Hansen, L.P. and Heaton, J. and Yaron, A.(1996), Finit-Sample Properties of Some Alternative GMM Estimators. Journal of Business and Economic Statistics, 14 262-280.

Examples

Run this code
## CAPM test with GMM
data(Finance)
r <- Finance[1:300, 1:10]
rm <- Finance[1:300, "rm"]
rf <- Finance[1:300, "rf"]

z <- as.matrix(r-rf)
t <- nrow(z)
zm <- rm-rf
h <- matrix(zm, t, 1)
res <- gmm(z ~ zm, x = h)
summary(res)

## linear tests can be performed using linearHypothesis from the car package
## The CAPM can be tested as follows:

library(car)
linearHypothesis(res,cbind(diag(10),matrix(0,10,10)),rep(0,10))

# The CAPM of Black
g <- function(theta, x) {
	e <- x[,2:11] - theta[1] - (x[,1] - theta[1]) %*% matrix(theta[2:11], 1, 10)
	gmat <- cbind(e, e*c(x[,1]))
	return(gmat) }

x <- as.matrix(cbind(rm, r))
res_black <- gmm(g, x = x, t0 = rep(0, 11))

summary(res_black)$coefficients


## APT test with Fama-French factors and GMM

f1 <- zm
f2 <- Finance[1:300, "hml"] - rf
f3 <- Finance[1:300, "smb"] - rf
h <- cbind(f1, f2, f3)
res2 <- gmm(z ~ f1 + f2 + f3, x = h)
coef(res2)
summary(res2)$coefficients

## Same result with x defined as a formula:

res2 <- gmm(z ~ f1 + f2 + f3, ~ f1 + f2 + f3)
coef(res2)

## The following example has been provided by Dieter Rozenich (see details).
# It generates normal random numbers and uses the GMM to estimate 
# mean and sd.
#-------------------------------------------------------------------------------
# Random numbers of a normal distribution
# First we generate normally distributed random numbers and compute the two parameters:
n <- 1000
x <- rnorm(n, mean = 4, sd = 2)
# Implementing the 3 moment conditions
g <- function(tet, x)
        {
        m1 <- (tet[1] - x)
        m2 <- (tet[2]^2 - (x - tet[1])^2)
        m3 <- x^3 - tet[1]*(tet[1]^2 + 3*tet[2]^2)
        f <- cbind(m1, m2, m3)
        return(f)
        }
# Implementing the jacobian
Dg <- function(tet, x)
        {
        jacobian <- matrix(c( 1, 2*(-tet[1]+mean(x)), -3*tet[1]^2-3*tet[2]^2,0, 2*tet[2],-6*tet[1]*tet[2]), nrow=3,ncol=2)
        return(jacobian)
        }
# Now we want to estimate the two parameters using the GMM.
gmm(g, x, c(0, 0), grad = Dg)

# Two-stage-least-squares (2SLS), or IV with iid errors.
# The model is:
# Y(t) = b[0] + b[1]C(t) + b[2]Y(t-1) + e(t)
# e(t) is an MA(1)
# The instruments are Z(t)={1 C(t) y(t-2) y(t-3) y(t-4)}

getdat <- function(n) {
e <- arima.sim(n,model=list(ma=.9))
C <- runif(n,0,5)
Y <- rep(0,n)
Y[1] = 1 + 2*C[1] + e[1]
for (i in 2:n){
Y[i] = 1 + 2*C[i] + 0.9*Y[i-1] + e[i]
}
Yt <- Y[5:n]
X <- cbind(1,C[5:n],Y[4:(n-1)])
Z <- cbind(1,C[5:n],Y[3:(n-2)],Y[2:(n-3)],Y[1:(n-4)]) 
return(list(Y=Yt,X=X,Z=Z))
}

d <- getdat(5000)
res4 <- gmm(d$Y~d$X-1,~d$Z-1,vcov="iid")
res4

Run the code above in your browser using DataLab