Method of Moments
The k k k -th moment is μ k = E [ X k ] \mu_k = E[X^k] μ k = E [ X k ] and the sample moment μ ^ k = 1 n ∑ i = 1 n X i k \hat{\mu}_k = \frac{1}{n}\sum_{i=1}^n X_i^k μ ^ k = n 1 ∑ i = 1 n X i k . Match them and solve for θ \theta θ .
The standard error σ θ ^ = V a r ( θ ^ ) \sigma_{\hat{\theta}} = \sqrt{\mathrm{Var}(\hat{\theta})} σ θ ^ = Var ( θ ^ ) depends on the true θ 0 \theta_0 θ 0 , and s θ ^ s_{\hat{\theta}} s θ ^ replaces θ 0 \theta_0 θ 0 with θ ^ \hat{\theta} θ ^ . E.g. for Poisson, λ ^ = X ˉ \hat{\lambda} = \bar{X} λ ^ = X ˉ , σ λ ^ = λ 0 / n \sigma_{\hat{\lambda}} = \sqrt{\lambda_0 / n} σ λ ^ = λ 0 / n , s λ ^ = λ ^ / n s_{\hat{\lambda}} = \sqrt{\hat{\lambda} / n} s λ ^ = λ ^ / n .
θ ^ n \hat{\theta}_n θ ^ n is consistent if P ( ∣ θ ^ n − θ ∣ > ϵ ) → 0 P(|\hat{\theta}_n - \theta| > \epsilon) \to 0 P ( ∣ θ ^ n − θ ∣ > ϵ ) → 0 as n → ∞ n \to \infty n → ∞ for all ϵ > 0 \epsilon > 0 ϵ > 0 .
Maximum Likelihood
l i k ( θ ) = f ( x 1 , … , x n ∣ θ ) = ∏ i = 1 n f ( x i ∣ θ ) if IID , l ( θ ) = ∑ i = 1 n log f ( x i ∣ θ ) \mathrm{lik}(\theta) = f(x_1, \ldots, x_n | \theta) = \prod_{i=1}^n f(x_i | \theta) \text{ if IID}, \qquad l(\theta) = \sum_{i=1}^n \log f(x_i | \theta) lik ( θ ) = f ( x 1 , … , x n ∣ θ ) = i = 1 ∏ n f ( x i ∣ θ ) if IID , l ( θ ) = i = 1 ∑ n log f ( x i ∣ θ )
The Fisher information is
I ( θ ) = E [ ( ∂ ∂ θ log f ( X ∣ θ ) ) 2 ] = − E [ ∂ 2 ∂ θ 2 log f ( X ∣ θ ) ] I(\theta) = E\Big[ \Big( \frac{\partial}{\partial \theta}\log f(X | \theta) \Big)^2 \Big] = -E\Big[ \frac{\partial^2}{\partial \theta^2}\log f(X | \theta) \Big] I ( θ ) = E [ ( ∂ θ ∂ log f ( X ∣ θ ) ) 2 ] = − E [ ∂ θ 2 ∂ 2 log f ( X ∣ θ ) ]
(the second form if f f f is smooth). Under regularity conditions (the support does not depend on the parameter, and f f f is smooth in θ \theta θ ):
the MLE is consistent,
n I ( θ 0 ) ( θ ^ − θ 0 ) → N ( 0 , 1 ) \sqrt{nI(\theta_0)}\,(\hat{\theta} - \theta_0) \to \mathcal{N}(0, 1) n I ( θ 0 ) ( θ ^ − θ 0 ) → N ( 0 , 1 ) in distribution, so for large n n n the MLE is approximately N ( θ 0 , 1 n I ( θ 0 ) ) \mathcal{N}\big(\theta_0, \frac{1}{nI(\theta_0)}\big) N ( θ 0 , n I ( θ 0 ) 1 ) , with asymptotic variance 1 n I ( θ 0 ) = 1 − E [ l ′ ′ ( θ 0 ) ] \frac{1}{nI(\theta_0)} = \frac{1}{-E[l''(\theta_0)]} n I ( θ 0 ) 1 = − E [ l ′′ ( θ 0 )] 1 ,
an approximate 100 ( 1 − α ) % 100(1 - \alpha)\% 100 ( 1 − α ) % confidence interval is θ ^ ± z ( α / 2 ) 1 n I ( θ ^ ) \hat{\theta} \pm z(\alpha/2) \frac{1}{\sqrt{nI(\hat{\theta})}} θ ^ ± z ( α /2 ) n I ( θ ^ ) 1 , or θ ^ ± z ( α / 2 ) s θ ^ \hat{\theta} \pm z(\alpha/2)\, s_{\hat{\theta}} θ ^ ± z ( α /2 ) s θ ^ .
Asymptotics
n ( X ˉ − E [ X 1 ] ) → d N ( 0 , σ 2 ) , X ˉ → P E [ X 1 ] \sqrt{n}(\bar{X} - E[X_1]) \xrightarrow{d} \mathcal{N}(0, \sigma^2), \qquad \bar{X} \xrightarrow{P} E[X_1] n ( X ˉ − E [ X 1 ]) d N ( 0 , σ 2 ) , X ˉ P E [ X 1 ]
and for g g g differentiable (delta method),
n ( g ( X ˉ ) − g ( E [ X 1 ] ) ) → d N ( 0 , g ′ ( E [ X 1 ] ) 2 σ 2 ) \sqrt{n}\big(g(\bar{X}) - g(E[X_1])\big) \xrightarrow{d} \mathcal{N}\big(0, g'(E[X_1])^2 \sigma^2\big) n ( g ( X ˉ ) − g ( E [ X 1 ]) ) d N ( 0 , g ′ ( E [ X 1 ] ) 2 σ 2 )
Efficiency and the Cramér-Rao Bound
M S E = V a r ( θ ^ ) + B i a s 2 = V a r ( θ ^ ) + ( E [ θ ^ ] − θ 0 ) 2 , e f f ( θ ^ , θ ~ ) = V a r ( θ ~ ) V a r ( θ ^ ) \mathrm{MSE} = \mathrm{Var}(\hat{\theta}) + \mathrm{Bias}^2 = \mathrm{Var}(\hat{\theta}) + (E[\hat{\theta}] - \theta_0)^2, \qquad \mathrm{eff}(\hat{\theta}, \tilde{\theta}) = \frac{\mathrm{Var}(\tilde{\theta})}{\mathrm{Var}(\hat{\theta})} MSE = Var ( θ ^ ) + Bias 2 = Var ( θ ^ ) + ( E [ θ ^ ] − θ 0 ) 2 , eff ( θ ^ , θ ~ ) = Var ( θ ^ ) Var ( θ ~ )
The efficiency is the ratio of sample sizes needed to get the same variance.
Cramér-Rao If X 1 , … , X n X_1, \ldots, X_n X 1 , … , X n are IID with f f f smooth and T = t ( X 1 , … , X n ) T = t(X_1, \ldots, X_n) T = t ( X 1 , … , X n ) is unbiased,
V a r ( T ) ≥ 1 n I ( θ ) \mathrm{Var}(T) \ge \frac{1}{nI(\theta)} Var ( T ) ≥ n I ( θ ) 1
and without the unbiasedness,
V a r ( T ) ≥ ( ∂ ∂ θ E [ T ] ) 2 n I ( θ ) \mathrm{Var}(T) \ge \frac{\big( \frac{\partial}{\partial \theta}E[T] \big)^2}{nI(\theta)} Var ( T ) ≥ n I ( θ ) ( ∂ θ ∂ E [ T ] ) 2
Sufficiency
T T T is sufficient for θ \theta θ if the conditional distribution of X 1 , … , X n X_1, \ldots, X_n X 1 , … , X n given T T T does not depend on θ \theta θ .
Factorization T T T is sufficient iff f ( x 1 , … , x n ∣ θ ) = g ( T , θ ) h ( x 1 , … , x n ) f(x_1, \ldots, x_n | \theta) = g(T, \theta)\, h(x_1, \ldots, x_n) f ( x 1 , … , x n ∣ θ ) = g ( T , θ ) h ( x 1 , … , x n ) . If T T T is sufficient and g g g is one-to-one, g ( T ) g(T) g ( T ) is sufficient.
E.g. for X i ∼ N ( μ , σ 2 ) X_i \sim \mathcal{N}(\mu, \sigma^2) X i ∼ N ( μ , σ 2 ) ,
f ( x 1 , … , x n ∣ μ , σ 2 ) = ( 1 σ 2 π ) n exp ( − 1 2 σ 2 ∑ i = 1 n ( x i − μ ) 2 ) = ( 1 σ 2 π ) n exp ( − 1 2 σ 2 [ ∑ i = 1 n x i 2 − 2 μ n x ˉ + n μ 2 ] ) f(x_1, \ldots, x_n | \mu, \sigma^2) = \Big( \frac{1}{\sigma\sqrt{2\pi}} \Big)^n \exp\Big( -\frac{1}{2\sigma^2}\sum_{i=1}^n (x_i - \mu)^2 \Big) = \Big( \frac{1}{\sigma\sqrt{2\pi}} \Big)^n \exp\Big( -\frac{1}{2\sigma^2}\Big[ \sum_{i=1}^n x_i^2 - 2\mu n\bar{x} + n\mu^2 \Big] \Big) f ( x 1 , … , x n ∣ μ , σ 2 ) = ( σ 2 π 1 ) n exp ( − 2 σ 2 1 i = 1 ∑ n ( x i − μ ) 2 ) = ( σ 2 π 1 ) n exp ( − 2 σ 2 1 [ i = 1 ∑ n x i 2 − 2 μ n x ˉ + n μ 2 ] )
which depends on the data only through ∑ x i 2 \sum x_i^2 ∑ x i 2 and x ˉ \bar{x} x ˉ , so ( X ˉ , S 2 ) (\bar{X}, S^2) ( X ˉ , S 2 ) is sufficient for ( μ , σ 2 ) (\mu, \sigma^2) ( μ , σ 2 ) .
Bayesian Estimation
The prior f Θ ( θ ) f_\Theta(\theta) f Θ ( θ ) is the distribution of the unknown θ \theta θ , f X ∣ Θ ( x ∣ θ ) f_{X|\Theta}(x | \theta) f X ∣Θ ( x ∣ θ ) the likelihood, and the posterior is
f Θ ∣ X ( θ ∣ x ) = f X , Θ ( x , θ ) f X ( x ) = f X ∣ Θ ( x ∣ θ ) f Θ ( θ ) ∫ f X ∣ Θ ( x ∣ θ ) f Θ ( θ ) d θ f_{\Theta|X}(\theta | x) = \frac{f_{X,\Theta}(x, \theta)}{f_X(x)} = \frac{f_{X|\Theta}(x | \theta)\, f_\Theta(\theta)}{\int f_{X|\Theta}(x | \theta)\, f_\Theta(\theta)\, d\theta} f Θ∣ X ( θ ∣ x ) = f X ( x ) f X , Θ ( x , θ ) = ∫ f X ∣Θ ( x ∣ θ ) f Θ ( θ ) d θ f X ∣Θ ( x ∣ θ ) f Θ ( θ )
with the denominator constant in θ \theta θ . The posterior mean is a function of the observed data.
A loss function l ( θ , a ) l(\theta, a) l ( θ , a ) measures the cost of estimating θ \theta θ by a a a , e.g. squared error ( a − θ ) 2 (a - \theta)^2 ( a − θ ) 2 , absolute error ∣ θ − a ∣ |\theta - a| ∣ θ − a ∣ , or 0-1 loss (0 if a = θ a = \theta a = θ , 1 otherwise). A decision rule δ \delta δ maps the data to an estimate, e.g. δ ( X 1 , … , X n ) = X 1 \delta(X_1, \ldots, X_n) = X_1 δ ( X 1 , … , X n ) = X 1 or X ˉ \bar{X} X ˉ , and the goal is to minimize E [ l ( θ , δ ( X 1 , … , X n ) ) ] E[l(\theta, \delta(X_1, \ldots, X_n))] E [ l ( θ , δ ( X 1 , … , X n ))] .