Equate the first sample moment about the origin to the first theoretical moment.
Equate the second sample moment about the origin to the second theoretical moment.
Repeat for all parameters.
Solve the system of equations for the parameters.
Formally
Given X<em>1,X</em>2,…,X<em>n∼f(x;θ), where θ=(θ</em>1,…,θ<em>t) has dimension t; the t moment estimators of θ are the unique solutions θ</em>1^,…,θt^ satisfying the system of equations:
M1=E[X1]
M2=E[X2]
⋮
Mt=E[Xt]
m<em>1=μ</em>1
m<em>2=μ</em>2
⋮
m<em>t=μ</em>t
Examples of Method of Moments Estimator
Poisson:
f(x,λ)=x!λxe−λ
E[X]=λ
λ^MM=Xˉ
Bernoulli:
f(x,p)=px(1−p)1−x
E[X]=p
p^MM=Xˉ
Uniform (0, θ):
f(x,θ)=θ−01
E[X]=21(0+θ)
θ^MM=2Xˉ
Normal (μ, σ2):
E[X]=μ
E[X2]=μ2+σ2
μ^MM=Xˉ
σ^2<em>MM=n1∑</em>i=1n(Xi−Xˉ)2
Binomial:
f(x;n,p)=(xn)px(1−p)n−x
E[X]=np
E[X2]=n(n−1)p2+np
n^<em>MM=Xˉ−(n1∑</em>i=1nXi2−Xˉ2)Xˉ2
p^<em>MM=1−Xˉ(n1∑</em>i=1nXi2−Xˉ2)
Consistency of Moments
If Y<em>1,…,Y</em>n are i.i.d. and E[∣Yk∣]<∞, then m<em>k→μ</em>k.
MoM estimators are often consistent.
Consistent Estimators Examples
Uniform(0, θ): θ^=2Yˉ→θ
Poisson(λ): λ^=Yˉ→λ
Normal(μ, σ2): μ^=Yˉ→μ and σ^2=n1∑(Yi−Yˉ)2→σ2
Bernoulli(p): p^=Yˉ→p
If a moment estimator θ^ is a continuous function g(m<em>1,…,m</em>t) and g(μ<em>1,…,μ</em>t)=θ, then θ^ is a consistent estimator.
Maximum Likelihood Estimation (MLE)
Find the maximum of the likelihood function to get the most likely parameter values.
The value(s) of θ that maximize L(θ;y)=f(y;θ).
The MLE of θ is θ^=argmaxθ∈ΘL(θ;y)
Optimization Refresher
For a twice-differentiable function g(x), any optimal point x∗ satisfies:
dxdg(x)∣x=x∗=0
x<em> is a local maximum if: dx2d2g(x)∣x=x</em><0
x<em> is a local minimum if: dx2d2g(x)∣x=x</em>>0
If g(x) > 0 for all x on an interval (a, b), then g(x) achieves a local minimum (or maximum) at x<em> if and only if log(g(x)) achieves a local minimum (or maximum) at x</em>.
Remarks on Maximum Likelihood
In the context of i.i.d. univariate models, Y<em>1,…,Y</em>n∼f(y;θ) i.i.d.
If θ^ is the MLE for θ, and if g(θ) is any transformation of θ, then the MLE for α=g(θ) is α^=g(θ^).
Another way to put this: If θ^ is MLE of θ, and t is any function with a twice-differentiable inverse on Θ, then t(θ^) is the MLE of t(θ).
Limiting Distribution of MLE
Under several regularity conditions:
n(θ^−θ)→N(0,I(θ)−1), where I(θ) is information.
I(θ)=E[−dθ2d2ℓ(θ;Y)]
MLE Terms and Conditions
Let Y<em>1,Y</em>2,…∼f(y;θ∗), and assume:
(A0) f is "identifiable": if θ=θ′, then for at least one y in the support set f(y;θ)=f(y;θ′)
(A1) f “has common support”: {y:f(y;θ)>0}={y;f(y;θ′)>0} for any θ,θ′
(A2) the parameter space Θ contains an open set ω and θ∗ is an interior point of ω
(A3) f is differentiable on ω
Under (A0) – (A3), the likelihood equation
dθdℓ(θ;Y)=0
Has a root (or solution) θ^<em>n such that θ^</em>n→θ∗
Corollary: If θ^<em>n is unique and Θ is an open interval, then with probability tending to 1, θ^</em>n is the MLE.
Asymptotic Normality of MLE
Let Y<em>1,Y</em>2,…∼f(y;θ∗), and now assume (A0) – (A1) hold along with:
(A2’) the parameter space Θ is an open interval;
(A3) the Fisher information is positive and finite; and a more complicated rule related to f being thrice differentiable: Any consistent root of the likelihood satisfies
n(θ^MLE−θ)→N(0,I(θ)1)
θ^MLE→θ
Recap
Method of moments derives point estimators by equating sample moments and population moments.
Maximum likelihood estimation provides a framework for deriving point estimators by optimizing the likelihood of data.
MoM estimates are usually consistent.
MLEs are invariant for transformations of parameters and asymptotically normal.