Estimation of Mean and Variance: MLE and Properties, Study notes of Electrical and Electronics Engineering

The solution to estimating the mean and variance using maximum likelihood estimation (mle) for a set of independent and identically distributed random variables with normal distribution. The document derives the expressions for the mle of mean and variance, discusses desirable properties of estimators, and introduces concepts such as unbiasedness, asymptotic unbiasedness, consistency, and weak law of large numbers.

Typology: Study notes

Pre 2010

Uploaded on 09/02/2009

koofers-user-2od-2
koofers-user-2od-2 🇺🇸

4

(1)

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
EECS 501 ESTIMATOR PROPERTIES Fall 2001
Problem: Let {x1. . . xN}be iidrv with xiN(m, σ2) and m, σ2unknown.
Want: To compute ˆmMLE and ˆσ2
MLE based on observations {X1. . . XN}.
Solution: fx1...xN(X1. . . XN) = QN
i=1 1
2πσ2e1
2(Xim)22since xiindpt rvs.
Set: 0 =
∂m log fx1...xN=
∂m [N
2log(2π)N
2log σ21
2PN
i=1(Xim)22]
=1
σ2PN
i=1(Xim) = 0 ˆmM LE =1
NPN
i=1 Xi=sample mean.
Set: 0 =
∂σ2log fx1...xN=
∂σ2[N
2log(2π)N
2log σ21
2PN
i=1(Xim)22]
=N
2
1
σ2+1
2PN
i=1(Xim)2/(σ2)2= 0 ˆσ2
MLE =1
NPN
i=1(Xim)2.
Replace min ˆσ2
MLE with ˆmMLE ˆσ2
MLE =sample variance.
Note: ˆσM LE =pˆσ2
M LE : MLE commutes with nonlinear functions g(a).
Why? argmax
Afr|a(R|A) = argmax
g(A)fr|g(a)(R|g(A)). No Jacobian for ag(a).
Q: What are some desirable properties for estimators to have?
DEF: Unbiased estimator has Ea(x1. . . xN)] = A(xinow treated as rvs).
DEF: Asymptotically unbiased estimator has lim
N→∞Ea(x1. . . xN)] = A.
Sample mean is unbiased: E[ ˆm] = E[1
NPN
i=1 xi] = 1
NPN
i=1 E[xi] = m.
Sample variance is biased:Eσ2] = E[1
NPN
i=1(Xiˆm)2] = N1
Nσ2.
Sample variance is asymp. unbiased: lim
N→∞Eσ2] = lim
N→∞
N1
Nσ2=σ2.
Note: ˆσ2=1
N1PN
i=1(Xi1
NPN
j=1 Xj)2is an unbiased estimator of σ2.
Note: If we know mean m, then the sample variance is unbiased estimator.
Note: Algebra for sample variance biased and consistent is on pp. 274-5.
DEF: Seq. of rvs {a1, a2. . .} a in probability if lim
N→∞P r[|aNa|> ²] = 0.
DEF: Consistent estimator has lim
N→∞ˆa(x1. . . xN) = a in probability .
Means: More data helps: The distribution of ˆabecomes tighter around a.
Sample mean is consistent: Use the Chebyschev inequality:
P r[|ˆmm|> ²] = P r[|ˆmE[ ˆm]|> ²]σ2
ˆm
²2=σ2
N²20 as N .
Using: ˆmunbiased and σ2
ˆm=1
N2PN
i=1 σ2=σ2
N. We have just proved the:
Thm: Weak Law of Large Numbers: Let {xi}be iidrv with E[xi], σ2
i<.
The sample mean is a consistent estimator of the expectation E[xi].
Means: Mean ˆmof data approaches mean m=E[xi] of random variables.

Partial preview of the text

Download Estimation of Mean and Variance: MLE and Properties and more Study notes Electrical and Electronics Engineering in PDF only on Docsity!

EECS 501 ESTIMATOR PROPERTIES Fall 2001

Problem: Let {x 1... xN } be iidrv with xi ∼ N (m, σ^2 ) and m, σ^2 unknown.

Want: To compute ˆmM LE and ˆσ M LE^2 based on observations {X 1... XN }.

Solution: fx 1 ...xN (X 1... XN ) =

∏N

i= √^1 2 πσ^2

e−^

1 2 (Xi−m)

(^2) /σ 2 since xi indpt rvs.

Set: 0 = (^) ∂m∂ log fx 1 ...xN = (^) ∂m∂ [− N 2 log(2π)− N 2 log σ^2 − (^12)

∑N

i=1(Xi^ −m)

(^2) /σ (^2) ]

= (^) σ^12

∑N

i=1(Xi^ −^ m) = 0^ →^ mˆM LE^ =^

1 N

∑N

i=1 Xi^ =^ sample mean.

Set: 0 = (^) ∂σ∂ 2 log fx 1 ...xN = (^) ∂σ∂ 2 [− N 2 log(2π)− N 2 log σ^2 − (^12)

∑N

i=1(Xi−m)

(^2) /σ (^2) ]

= − N 2 σ^12 + (^12)

∑N

i=1(Xi^ −^ m)

(^2) /(σ (^2) ) (^2) = 0 → σˆ 2 M LE =^

1 N

∑N

i=1(Xi^ −^ m)

Replace m in ˆσ^2 M LE with ˆmM LE → σˆ M LE^2 = sample variance. Note: ˆσM LE =

σˆ M LE^2 : MLE commutes with nonlinear functions g(a). Why? argmax A fr|a(R|A) = argmax g(A) fr|g(a)(R|g(A)). No Jacobian for a → g(a).

Q: What are some desirable properties for estimators to have? DEF: Unbiased estimator has E[ˆa(x 1... xN )] = A (xi now treated as rvs). DEF: Asymptotically unbiased estimator has

lim N →∞ E[ˆa(x^1... xN^ )] =^ A.

  • Sample mean is unbiased: E[ ˆm] = E[ (^) N^1

∑N

i=1 xi] =^

1 N

∑N

i=1 E[xi] =^ m.

  • Sample variance is biased: E[ˆσ^2 ] = E[ (^) N^1

∑N

i=1(Xi^ −^ mˆ)

2 ] = N − 1

N σ

  • Sample variance is asymp. unbiased: (^) Nlim →∞ E[ˆσ^2 ] = (^) Nlim →∞^ N N^ − 1 σ^2 = σ^2.

Note: ˆσ^2 = (^) N^1 − 1

∑N

i=1(Xi^ −^

1 N

∑N

j=1 Xj^ )

(^2) is an unbiased estimator of σ (^2).

Note: If we know mean m, then the sample variance is unbiased estimator. Note: Algebra for sample variance biased and consistent is on pp. 274-5.

DEF: Seq. of rvs {a 1 , a 2.. .} → a in probability if (^) Nlim →∞ P r[|aN − a| > ≤] = 0.

DEF: Consistent estimator has (^) Nlim →∞ aˆ(x 1... xN ) = a in probability. Means: More data helps: The distribution of ˆa becomes tighter around a.

  • Sample mean is consistent: Use the Chebyschev inequality:

P r[| mˆ − m| > ≤] = P r[| mˆ − E[ ˆm]| > ≤] ≤

σ^2 mˆ ≤^2 =^

σ^2 N ≤^2 →^ 0 as^ N^ → ∞. Using: mˆ unbiased and σ^2 mˆ = (^) N^1

∑N

i=1 σ

(^2) = σ^2 N. We have just proved the: Thm: Weak Law of Large Numbers: Let {xi} be iidrv with E[xi], σ i^2 < ∞. → The sample mean is a consistent estimator of the expectation E[xi]. Means: Mean ˆm of data approaches mean m = E[xi] of random variables.