digplanet beta 1: Athena
Share digplanet:

Agriculture

Applied sciences

Arts

Belief

Business

Chronology

Culture

Education

Environment

Geography

Health

History

Humanities

Language

Law

Life

Mathematics

Nature

People

Politics

Science

Society

Technology

In statistics, the Gauss–Markov theorem, named after Carl Friedrich Gauss and Andrey Markov, states that in a linear regression model in which the errors have expectation zero and are uncorrelated and have equal variances, the best linear unbiased estimator (BLUE) of the coefficients is given by the ordinary least squares (OLS) estimator. Here "best" means giving the lowest variance of the estimate, as compared to other unbiased, linear estimates. The errors need not be normal, nor independent and identically distributed (only uncorrelated and homoscedastic). The hypothesis that the estimator be unbiased cannot be dropped, since otherwise estimators better than OLS exist. See for examples the James–Stein estimator (which also drops linearity) or ridge regression.

Contents

Statement [edit]

Suppose we have

 Y_i=\sum_{j=1}^{K}\beta_j X_{ij}+\varepsilon_i

for i = 1, . . ., n, where β j are non-random but unobservable parameters, Xij are non-random and observable (called the "explanatory variables"), ε i are random, and so Y i are random. The random variables ε i are called the "residuals" or "noise" (will be contrasted with "errors" later in the article; see errors and residuals in statistics). Note that to include a constant in the model above, one can choose to include the variable XK all of whose observed values are unity: XiK = 1 for all i.

The Gauss–Markov assumptions are

  • E(\varepsilon_i)=0,
  • V(\varepsilon_i)= \sigma^2 < \infty,

(i.e., all residuals have the same variance; that is "homoscedasticity"), and

  • {\rm cov}(\varepsilon_i,\varepsilon_j) = 0, \forall i \neq j

for i ≠ j; that is, any the noise terms are drawn from an "uncorrelated" distribution. A linear estimator of β j is a linear combination

\widehat\beta_j = c_{1j}Y_1+\cdots+c_{nj}Y_n

in which the coefficients cij are not allowed to depend on the underlying coefficients βj, since those are not observable, but are allowed to depend on the values Xij, since these data are observable. (The dependence of the coefficients on each Xij is typically nonlinear; the estimator is linear in each Yi and hence in each random εi, which is why this is "linear" regression.) The estimator is said to be unbiased if and only if

E(\widehat\beta_j)=\beta_j\,

regardless of the values of Xij. Now, let \sum_{j=1}^K\lambda_j\beta_j be some linear combination of the coefficients. Then the mean squared error of the corresponding estimation is

E \left(\left(\sum_{j=1}^K\lambda_j(\widehat\beta_j-\beta_j)\right)^2\right);

i.e., it is the expectation of the square of the weighted sum (across parameters) of the differences between the estimators and the corresponding parameters to be estimated. (Since we are considering the case in which all the parameter estimates are unbiased, this mean squared error is the same as the variance of the linear combination.) The best linear unbiased estimator (BLUE) of the vector β of parameters βj is one with the smallest mean squared error for every vector λ of linear combination parameters. This is equivalent to the condition that

V(\tilde\beta)- V(\widehat\beta)

is a positive semi-definite matrix for every other linear unbiased estimator \tilde\beta.

The ordinary least squares estimator (OLS) is the function

\widehat\beta=(X'X)^{-1}X'Y

of Y and X (where X' denotes the transpose of X) that minimizes the sum of squares of residuals (misprediction amounts):

\sum_{i=1}^n\left(Y_i-\widehat{Y}_i\right)^2=\sum_{i=1}^n\left(Y_i-\sum_{j=1}^K\widehat\beta_j X_{ij}\right)^2.

The theorem now states that the OLS estimator is a BLUE. The main idea of the proof is that the least-squares estimator is uncorrelated with every linear unbiased estimator of zero, i.e., with every linear combination a_1Y_1+\cdots+a_nY_n whose coefficients do not depend upon the unobservable β but whose expected value is always zero.

Proof [edit]

Let  \tilde\beta = CY be another linear estimator of  \beta and let C be given by  (X'X)^{-1}X' + D , where D is a k \times n nonzero matrix. As we're restricting to unbiased estimators, minimum mean squared error implies minimum variance. The goal is therefore to show that such an estimator has a variance no smaller than that of  \hat\beta , the OLS estimator.

The expectation of  \tilde\beta is:


\begin{align}
E(CY) &= E(((X'X)^{-1}X' + D)(X\beta + \varepsilon)) \\
&= ((X'X)^{-1}X' + D)X\beta + ((X'X)^{-1}X' + D)\underbrace{E(\varepsilon)}_0 \\
&= (X'X)^{-1}X'X\beta + DX\beta \\
&= (I_k + DX)\beta. \\
\end{align}

Therefore,  \tilde\beta is unbiased if and only if  DX = 0 .

The variance of  \tilde\beta is


\begin{align}
V(\tilde\beta) &= V(CY) = CV(Y)C' = \sigma^2 CC' \\
&= \sigma^2((X'X)^{-1}X' + D)(X(X'X)^{-1} + D') \\
&= \sigma^2((X'X)^{-1}X'X(X'X)^{-1} + (X'X)^{-1}X'D' + DX(X'X)^{-1} + DD') \\
&= \sigma^2(X'X)^{-1} + \sigma^2(X'X)^{-1} (\underbrace{DX}_{0})' + \sigma^2 \underbrace{DX}_{0} (X'X)^{-1} + \sigma^2DD' \\
&= \underbrace{\sigma^2(X'X)^{-1}}_{V(\hat\beta)} + \sigma^2DD'.
\end{align}

Since DD' is a positive semidefinite matrix,  V(\tilde\beta) exceeds  V(\hat\beta) by a positive semidefinite matrix.

Generalized least squares estimator [edit]

The generalized least squares (GLS) or Aitken estimator extends the Gauss–Markov theorem to the case where the error vector has a non-scalar covariance matrix – the Aitken estimator is also a BLUE.[1]

See also [edit]

Other unbiased statistics [edit]

Notes [edit]

  1. ^ A. C. Aitken, "On Least Squares and Linear Combinations of Observations", Proceedings of the Royal Society of Edinburgh, 1935, vol. 55, pp. 42–48.

References [edit]

External links [edit]


Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/Gauss–Markov_theorem — Please support Wikipedia.
A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.
79 videos foundNext > 

5 Assumptions of CLRM c.avi

Overview of the Gauss-Markov Theorem.

5 Assumptions of CLRM a

Lecture 5 covers the Gauss-Markov Theorem: The assumptions of the Classical Linear Regression Model. Part a discusses some preliminary ideas, part b shows a ...

1.10-1 Gauss markov theorem part 1

www.learnitt.com . For assignment help/ homework help/Online Tutoring in Economics pls visit www.learnitt.com. This video explains Gauss markov theorem in si...

Econometrics: intuition to BLUE (Gauss Markov Theorem)

Economics 421/521 - Econometrics - Winter 2011 - Lecture 3 (HD)

Economics 421/521 - Econometrics - Winter 2011 - Lecture 3 (HD)

1.10-2 Gauss markov theorem part 2

www.learnitt.com . For assignment help/ homework help/Online Tutoring in Economics pls visit www.learnitt.com. This video explains Gauss markov theorem in si...

[ML-12] Hipótesis de Gauss-Markov

El error aleatorio del modelo teórico de regresión lineal recoge el efecto que sobre la variable dependiente tienen todas las variables no incluidas en el mo...

[ML-29] El teorema de Gauss-Markov. B es BLUE

Se demuestra el teorema de Gauss-Markov, que afirma que, si se cumplen las hipótesis de Gauss-Markov, entonces B es el mejor estimador lineal e insesgado. El...

6.5 LM Test for first order serial (Auto) correlation

www.learnitt.com. For Assignment help/Homework Help in Economics, Mathematics and Statistics please visit www.learnitt.com. This video explains LM Test for f...

12 9 2012 map prediction

Here I have uploaded the first result of implementation of our vision SLAM algorithm. The relevant paper is published in DSCC2012. Cite: @proceedings{Jadalih...

79 videos foundNext > 

We're sorry, but there's no news about "Gauss–Markov theorem" right now.

Loading

Oops, we seem to be having trouble contacting Twitter

Talk About Gauss–Markov theorem

You can talk about Gauss–Markov theorem with people all over the world in our discussions.

Support Wikipedia

A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia. Please add your support for Wikipedia!