Generalized least squares
   HOME

TheInfoList



OR:

In
statistics Statistics (from German: '' Statistik'', "description of a state, a country") is the discipline that concerns the collection, organization, analysis, interpretation, and presentation of data. In applying statistics to a scientific, indust ...
, generalized least squares (GLS) is a technique for estimating the unknown
parameter A parameter (), generally, is any characteristic that can help in defining or classifying a particular system (meaning an event, project, object, situation, etc.). That is, a parameter is an element of a system that is useful, or critical, when ...
s in a
linear regression In statistics, linear regression is a linear approach for modelling the relationship between a scalar response and one or more explanatory variables (also known as dependent and independent variables). The case of one explanatory variable is cal ...
model when there is a certain degree of
correlation In statistics, correlation or dependence is any statistical relationship, whether causal or not, between two random variables or bivariate data. Although in the broadest sense, "correlation" may indicate any type of association, in statistic ...
between the residuals in a
regression model In statistical modeling, regression analysis is a set of statistical processes for estimating the relationships between a dependent variable (often called the 'outcome' or 'response' variable, or a 'label' in machine learning parlance) and one o ...
. In these cases,
ordinary least squares In statistics, ordinary least squares (OLS) is a type of linear least squares method for choosing the unknown parameters in a linear regression model (with fixed level-one effects of a linear function of a set of explanatory variables) by the ...
and weighted least squares can be statistically inefficient, or even give misleading inferences. GLS was first described by
Alexander Aitken Alexander Craig "Alec" Aitken (1 April 1895 – 3 November 1967) was one of New Zealand's most eminent mathematicians. In a 1935 paper he introduced the concept of generalized least squares, along with now standard vector/matrix notation fo ...
in 1936.


Method outline

In standard
linear regression In statistics, linear regression is a linear approach for modelling the relationship between a scalar response and one or more explanatory variables (also known as dependent and independent variables). The case of one explanatory variable is cal ...
models we observe data \_ on ''n'' statistical units. The response values are placed in a vector \mathbf = \left( y_, \dots, y_ \right)^, and the predictor values are placed in the design matrix \mathbf = \left( \mathbf_^, \dots, \mathbf_^ \right)^, where \mathbf_ = \left( 1, x_, \dots, x_ \right) is a vector of the ''k'' predictor variables (including a constant) for the ''i''th unit. The model forces the
conditional mean In probability theory, the conditional expectation, conditional expected value, or conditional mean of a random variable is its expected value – the value it would take “on average” over an arbitrarily large number of occurrences – give ...
of \mathbf given \mathbf to be a linear function of \mathbf, and assumes the conditional
variance In probability theory and statistics, variance is the expectation of the squared deviation of a random variable from its population mean or sample mean. Variance is a measure of dispersion, meaning it is a measure of how far a set of numbe ...
of the error term given \mathbf is a ''known'' nonsingular ''
covariance matrix In probability theory and statistics, a covariance matrix (also known as auto-covariance matrix, dispersion matrix, variance matrix, or variance–covariance matrix) is a square matrix giving the covariance between each pair of elements of ...
'' \mathbf. This is usually written as : \mathbf = \mathbf \mathbf + \mathbf, \qquad \operatorname varepsilon\mid\mathbf0,\ \operatorname varepsilon\mid\mathbf \mathbf. Here \beta \in \mathbb^k is a vector of unknown constants (known as “regression coefficients”) that must be estimated from the data. Suppose \mathbf is a candidate estimate for \mathbf. Then the residual vector for \mathbf will be \mathbf- \mathbf \mathbf. The generalized least squares method estimates \mathbf by minimizing the squared Mahalanobis length of this residual vector: : \mathbf = \underset\operatorname\,(\mathbf- \mathbf \mathbf)^\mathbf^(\mathbf- \mathbf \mathbf) = \underset\operatorname\,\mathbf^\,\mathbf^\mathbf + (\mathbf \mathbf)^ \mathbf^ \mathbf \mathbf - \mathbf^\mathbf^\mathbf \mathbf-(\mathbf \mathbf)^\mathbf^\mathbf\, , where the last two terms evaluate to scalars, resulting in : \mathbf = \underset\operatorname\,\mathbf^\,\mathbf^\mathbf + \mathbf^ \mathbf^ \mathbf^ \mathbf \mathbf -2 \mathbf^ \mathbf ^\mathbf^\mathbf\, . This objective is a
quadratic form In mathematics, a quadratic form is a polynomial with terms all of degree two ("form" is another name for a homogeneous polynomial). For example, :4x^2 + 2xy - 3y^2 is a quadratic form in the variables and . The coefficients usually belong to ...
in \mathbf. Taking the gradient of this quadratic form with respect to \mathbf and equating it to zero (when \mathbf=\hat) gives : 2 \mathbf^ \mathbf^ \mathbf \hat -2 \mathbf ^\mathbf^\mathbf = 0 Therefore, the minimum of the objective function can be computed yielding the explicit formula: : \mathbf = \left( \mathbf^ \mathbf^ \mathbf \right)^ \mathbf^\mathbf^\mathbf. The quantity \mathbf^ is known as the '' precision matrix'' (or ''dispersion matrix''), a generalization of the diagonal weight matrix.


Properties

The GLS estimator is unbiased, consistent, efficient, and asymptotically normal with \operatorname hat\beta\mid\mathbf= \beta and \operatorname hat\mid\mathbf= (\mathbf^\Omega^\mathbf)^. GLS is equivalent to applying ordinary least squares to a linearly transformed version of the data. To see this, factor \mathbf = \mathbf \mathbf^, for instance using the Cholesky decomposition. Then if we pre-multiply both sides of the equation \mathbf = \mathbf \mathbf + \mathbf by \mathbf^, we get an equivalent linear model \mathbf^ = \mathbf^ \mathbf + \mathbf^ where \mathbf^ = \mathbf^ \mathbf, \mathbf^ = \mathbf^ \mathbf, and \mathbf^ = \mathbf^ \mathbf. In this model \operatorname varepsilon^\mid\mathbf \mathbf^ \mathbf \left(\mathbf^ \right)^ = \mathbf, where \mathbf is the
identity matrix In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere. Terminology and notation The identity matrix is often denoted by I_n, or simply by I if the size is immaterial or ...
. Thus we can efficiently estimate \mathbf by applying
Ordinary least squares In statistics, ordinary least squares (OLS) is a type of linear least squares method for choosing the unknown parameters in a linear regression model (with fixed level-one effects of a linear function of a set of explanatory variables) by the ...
(OLS) to the transformed data, which requires minimizing : \left(\mathbf^ - \mathbf^ \mathbf \right)^ (\mathbf^ - \mathbf^ \mathbf) = (\mathbf- \mathbf \mathbf)^\,\mathbf^(\mathbf- \mathbf \mathbf). This has the effect of standardizing the scale of the errors and “de-correlating” them. Since OLS is applied to data with homoscedastic errors, the Gauss–Markov theorem applies, and therefore the GLS estimate is the best linear unbiased estimator for ''β''.


Weighted least squares

A special case of GLS called weighted least squares (WLS) occurs when all the off-diagonal entries of ''Ω'' are 0. This situation arises when the variances of the observed values are unequal (i.e. 
heteroscedasticity In statistics, a sequence (or a vector) of random variables is homoscedastic () if all its random variables have the same finite variance. This is also known as homogeneity of variance. The complementary notion is called heteroscedasticity. The ...
is present), but where no correlations exist among the observed variances. The weight for unit ''i'' is proportional to the reciprocal of the variance of the response for unit ''i''.


Feasible generalized least squares

If the covariance of the errors \Omega is unknown, one can get a consistent estimate of \Omega , say \widehat \Omega ,Baltagi, B. H. (2008). Econometrics (4th ed.). New York: Springer. using an implementable version of GLS known as the feasible generalized least squares (FGLS) estimator. In FGLS, modeling proceeds in two stages: (1) the model is estimated by OLS or another consistent (but inefficient) estimator, and the residuals are used to build a consistent estimator of the errors covariance matrix (to do so, one often needs to examine the model adding additional constraints, for example if the errors follow a time series process, a statistician generally needs some theoretical assumptions on this process to ensure that a consistent estimator is available); and (2) using the consistent estimator of the covariance matrix of the errors, one can implement GLS ideas. Whereas GLS is more efficient than OLS under
heteroscedasticity In statistics, a sequence (or a vector) of random variables is homoscedastic () if all its random variables have the same finite variance. This is also known as homogeneity of variance. The complementary notion is called heteroscedasticity. The ...
(also spelled heteroskedasticity) or
autocorrelation Autocorrelation, sometimes known as serial correlation in the discrete time case, is the correlation of a signal with a delayed copy of itself as a function of delay. Informally, it is the similarity between observations of a random variable ...
, this is not true for FGLS. The feasible estimator is, provided the errors covariance matrix is consistently estimated, ''asymptotically'' more efficient, but for a small or medium size sample, it can be actually less efficient than OLS. This is why some authors prefer to use OLS, and reformulate their inferences by simply considering an alternative estimator for the variance of the estimator robust to heteroscedasticity or serial autocorrelation. But for large samples FGLS is preferred over OLS under heteroskedasticity or serial correlation.Greene, W. H. (2003). Econometric Analysis (5th ed.). Upper Saddle River, NJ: Prentice Hall. A cautionary note is that the FGLS estimator is not always consistent. One case in which FGLS might be inconsistent is if there are individual specific fixed effects. In general this estimator has different properties than GLS. For large samples (i.e., asymptotically) all properties are (under appropriate conditions) common with respect to GLS, but for finite samples the properties of FGLS estimators are unknown: they vary dramatically with each particular model, and as a general rule their exact distributions cannot be derived analytically. For finite samples, FGLS may be even less efficient than OLS in some cases. Thus, while GLS can be made feasible, it is not always wise to apply this method when the sample is small. A method sometimes used to improve the accuracy of the estimators in finite samples is to iterate, i.e. taking the residuals from FGLS to update the errors covariance estimator, and then updating the FGLS estimation, applying the same idea iteratively until the estimators vary less than some tolerance. But this method does not necessarily improve the efficiency of the estimator very much if the original sample was small. A reasonable option when samples are not too large is to apply OLS, but throwing away the classical variance estimator : \sigma^2*(X'X)^ (which is inconsistent in this framework) and using a HAC (Heteroskedasticity and Autocorrelation Consistent) estimator. For example, in autocorrelation context we can use the Bartlett estimator (often known as Newey–West estimator estimator since these authors popularized the use of this estimator among econometricians in their 1987 ''Econometrica'' article), and in heteroskedastic context we can use the Eicker–White estimator. This approach is much safer, and it is the appropriate path to take unless the sample is large, and "large" is sometimes a slippery issue (e.g. if the errors distribution is asymmetric the required sample would be much larger). The
ordinary least squares In statistics, ordinary least squares (OLS) is a type of linear least squares method for choosing the unknown parameters in a linear regression model (with fixed level-one effects of a linear function of a set of explanatory variables) by the ...
(OLS) estimator is calculated as usual by : \widehat \beta_\text = (X' X)^ X' y and estimates of the residuals \widehat_j= (Y-X\widehat\beta_\text)_j are constructed. For simplicity consider the model for heteroscedastic and not autocorrelated errors. Assume that the variance-covariance matrix \Omega of the error vector is diagonal, or equivalently that errors from distinct observations are uncorrelated. Then each diagonal entry may be estimated by the fitted residuals \widehat_j so \widehat_ may be constructed by : \widehat_\text = \operatorname(\widehat^2_1, \widehat^2_2, \dots , \widehat^2_n). It is important to notice that the squared residuals cannot be used in the previous expression; we need an estimator of the errors variances. To do so, we can use a parametric heteroskedasticity model, or a nonparametric estimator. Once this step is fulfilled, we can proceed: Estimate \beta_ using \widehat_\text using weighted least squares : \widehat \beta_ = (X'\widehat^_\text X)^ X' \widehat^_\text y The procedure can be iterated. The first iteration is given by : \widehat_ = Y - X \widehat \beta_ : \widehat_ = \operatorname(\widehat^2_, \widehat^2_, \dots ,\widehat^2_) : \widehat \beta_ = (X'\widehat^_ X)^ X' \widehat^_ y This estimation of \widehat can be iterated to convergence. Under regularity conditions any of the FGLS estimator (or that of any of its iterations, if we iterate a finite number of times) is asymptotically distributed as : \sqrt(\hat\beta_ - \beta)\ \xrightarrow\ \mathcal\!\left(0,\,V\right). where n is the sample size and : V = \operatorname(X'\Omega^X/T) here p-lim means limit in probability


See also

*
Confidence region In statistics, a confidence region is a multi-dimensional generalization of a confidence interval. It is a set of points in an ''n''-dimensional space, often represented as an ellipsoid around a point which is an estimated solution to a problem, a ...
* Effective degrees of freedom * Prais–Winsten estimation


References


Further reading

* * * * {{DEFAULTSORT:Generalized Least Squares Least squares Estimation methods Regression with time series structure