6. MLE Flashcards
Likelihood function
the pdf seen as a function of @ for a given sample x, the ratio of likelihood functions gives us which @ is more likely to be the correct estimator
- if L(x) =c(x,x)L(x) where c depends solely on x and x*, then inference coincides
MLE and how to find it
it the estimator that maximises the likelihood function:
- look at the shape of the function
- maximize the function using first and second derivative on the log-likelihood
- cannot compute it
Invariance property
if A is the MLE for @ then g(A) is the MLE for g(@)
MLE and SUFF
By the factorization th, the MLE is always a function of the SUFF stat
Newton-Raphson algorithm
it’s an all-purpose algorithm to find the solutions of non linear equations: knowing that A is a root of l’, then using the Taylor expansion we use a guess (a) and, by iteration, we get increasingly closer to A:
A~= a - l’(a)/l’‘(a)
Asymptotic properties
Under regularity conditions, the MLE is asymptotically normal and efficient and consistent in probability
- the asymptotic variance (Mann-Wald + CR) is (g’(@))^2/I_X