Scoring algorithm
Form of Newton's method used in statistics
Scoring algorithm, also known as Fisher's scoring, is a form of Newton's method used in statistics to solve maximum likelihood equations numerically, named after Ronald Fisher.
01Sketch of derivation
Let be random variables, independent and identically distributed with twice differentiable p.d.f.
, and we wish to calculate the maximum likelihood estimator (M.L.E.)
of
. First, suppose we have a starting point for our algorithm
, and consider a Taylor expansion of the score function,
, about
:
where
is the observed information matrix at . Now, setting
, using that
and rearranging gives us:
We therefore use the algorithm
and under certain regularity conditions, it can be shown that .
02Fisher scoring
In practice, is usually replaced by
, the Fisher information, thus giving us the Fisher Scoring Algorithm:
..
Under some regularity conditions, if is a consistent estimator, then
(the correction after a single step) is 'optimal' in the sense that its error distribution is asymptotically identical to that of the true max-likelihood estimate.
Sources and credits
This article is adapted from the Wikipedia article “Scoring algorithm”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.