Point Estimation
A point estimator is any function \(W(X_1, \cdots, X_n)\) of a sample; that is, any statistic is a point estimator.
The method of moments is a technique for constructing point estimators by equating sample moments to population moments.
Let \(X_1, X_2, \cdots, X_n\) be a sample from a population with pdf or pmf \(f(x|\theta)\). Define
The population moments \(\mu'_j\) will typically be a function of \(\theta_1,\cdots,\theta_k\), say \(\mu'_j(\theta_1,\cdots,\theta_k)\). The method of moments estimator \((\hat{\theta}_1, \cdots, \hat{\theta}_k)\) of \((\theta_1, \cdots, \theta_k)\) is obtained by solving the following system of equations for \((\theta_1, \cdots, \theta_k)\) in terms of \((m_1, \cdots, m_k)\):
The method of maximum likelihood is a technique for constructing point estimators by maximizing the likelihood function, that if \(X_1, \cdots, X_n\) is a sample from a population with pdf or pmf \(f(x|\theta_1,\cdots,\theta_k)\), then the likelihood function is defined by
For each sample point \(\bm{x}\), let \(\hat{\theta}(\bm{x})\) be a parameter value at which \(L(\theta|\bm{x})\) attains its maximum as a function of \(\theta\), with \(\bm{x}\) held fixed. A maximum likelihood estimator (MLE) of the parameter \(\theta\) based on a sample \(\bm{X}\) is \(\hat{\theta}(\bm{X})\).
Theorem 7.2.10 If \(\hat{\theta}\) is the MLE of \(\theta\), then for any function \(\tau(\theta)\), the MLE of \(\tau(\theta)\) is \(\tau(\hat{\theta})\).
The EM(Expectation-Maximization) algorithm is an iterative method for finding MLEs when the data is incomplete or has missing values. It consists of two steps: the E-step, where we compute the expected value of the log-likelihood function with respect to the current estimate of the parameters, and the M-step, where we maximize this expected log-likelihood to update our parameter estimates.
The EM algorithm allows us to maximize \(L(\theta|\bm{y})\) by working with only \(L(\theta|\bm{y},\bm{x})\) and the conditional pdf or pmf of \(\bm{X}\) given \(\bm{y}\) and \(\theta\) defined by
which gives the identity
As \(\bm{x}\) is missing data and hence not observed, we replace the riht side of above with its expection under \(k(\bm{x}|\theta',\bm{y})\):
From an initial value \(\theta^{(0)}\), we can create a sequence \(\theta^{(r)}\) according to
Theorem 7.2.20 The sequence \(\left\{\hat{\theta}^{(r)}\right\}\) defined by above satisfies
with equality holding iff successive iterations yield the same value of the maximized expected complete-data log likelihood, that is
The mean squared error (MSE) of an estimator \(W\) of a parameter \(\theta\) is the function of \(\theta\) defined by \(E_\theta(W-\theta)^2\).
The bias of a point estimator \(W\) of a parameter \(\theta\) is defined by \(\mathrm{Bias}_\theta(W)=E_\theta(W)-\theta\). An estimator is unbiased if \(\mathrm{Bias}_\theta(W)=0\) for all \(\theta\).