2.2 Properties of the Score and Information

Let \(A = \{x : f_\theta (x)>0\}\) be the support. Since \(\int _A f_\theta (x)\,dx = 1\) for every \(\theta \), \[\int _A\frac {\partial }{\partial \theta }f_\theta (x)\,dx = \frac {\partial }{\partial \theta }\int _A f_\theta (x)\,dx = 0,\] provided the derivative and the integral can be interchanged, and similarly for the second derivative. Models in which \(A\) does not depend on \(\theta \) and these interchanges are valid are called regular. The uniform model of example 2.1.4 is not regular.

Theorem 2.2.1. If \(X = (X_1, \dots , X_n)\) is a random sample from a regular model, then

(i)
\(E_\theta \left [S(\theta ; X)\right ] = 0\), and
(ii)
\(\var _\theta \left [S(\theta ; X)\right ] = E_\theta \left [S(\theta ; X)^2\right ] = J(\theta )\).

Proof.

(i)
For one observation, \[E_\theta \left [S_1(\theta ; X)\right ] = \int _A\frac {f'_\theta (x)}{f_\theta (x)}f_\theta (x)\,dx = \int _A f'_\theta (x)\,dx = 0 ,\] and \(S\) is a sum of \(n\) such terms.
(ii)
By (i), \(\var (S) = E(S^2)\). Since \(S = \sum _i S_1(\theta ; X_i)\) with independent terms of mean zero, the cross terms \(E\left [S_1(\theta ; X_i)S_1(\theta ; X_j)\right ] = 0\) for \(i\ne j\), and \[E(S^2) = \sum _{i=1}^n E\left [S_1(\theta ; X_i)^2\right ] = \sum _{i=1}^n E\left [\left (\frac {f'_\theta (X_i)}{f_\theta (X_i)}\right )^2\right ].\] On the other hand, taking expectations in (2.1), \[J(\theta ) = \sum _{i=1}^n E\left [\left (\frac {f'_\theta (X_i)}{f_\theta (X_i)}\right )^2\right ] - \sum _{i=1}^n E\left [\frac {f''_\theta (X_i)}{f_\theta (X_i)}\right ],\] and each term of the second sum is \(\int _A f''_\theta (x)\,dx = \frac {\partial ^2}{\partial \theta ^2}\int _A f_\theta (x)\,dx = 0\). So \(J(\theta ) = E(S^2)\).
□

Example 2.2.2. Verify theorem 2.2.1 for a random sample from \(\text {POI}(\theta )\).

Solution. From example 2.1.3, \(S(\theta ) = -n + \frac 1\theta \sum X_i\) and \(J(\theta ) = \frac n\theta \). Then \[E(S) = -n + \frac {n\theta }{\theta } = 0,\qquad \var (S) = \frac {1}{\theta ^2}\sum \var (X_i) = \frac {n\theta }{\theta ^2} = \frac n\theta = J(\theta ).\]

Example 2.2.3. Let \(X_1, \dots , X_n\) be a random sample from the exponential distribution with mean \(\theta \). Find the ML estimator, the observed and Fisher information, and check that \(J(\theta ) = \var (S)\).

Solution. \(\mathcal {L}(\theta ) = -n\ln \theta - \frac 1\theta \sum x_i\), so \[S(\theta ) = -\frac n\theta + \frac {\sum x_i}{\theta ^2},\qquad I(\theta ) = -\frac {n}{\theta ^2} + \frac {2\sum x_i}{\theta ^3} .\] The score equation gives \(\hat \theta = \bar x\), and \(I(\hat \theta ) = -\frac {n}{\bar x^2} + \frac {2n}{\bar x^2} = \frac {n}{\bar x^2}>0\). Since \(E(X_i) = \theta \), \[J(\theta ) = -\frac {n}{\theta ^2} + \frac {2n\theta }{\theta ^3} = \frac {n}{\theta ^2},\qquad \var (S) = \frac {1}{\theta ^4}\sum \var (X_i) = \frac {n\theta ^2}{\theta ^4} = \frac {n}{\theta ^2} .\] Note that \(I(\theta )\) depends on the data and can be negative for \(\theta \) far from \(\hat \theta \); only its expectation \(J(\theta )\) is guaranteed to be positive.

2.2.1 The Multiparameter Score and Information

When \(\theta = (\theta _1, \dots , \theta _k)^{\mathsf T}\) is a vector the same ideas apply componentwise.

  • The score is the vector \(S(\theta ) = \left (\frac {\partial \mathcal {L}}{\partial \theta _1}, \dots , \frac {\partial \mathcal {L}}{\partial \theta _k}\right )^{\mathsf T}\).
  • The information is the \(k\times k\) matrix \(I(\theta ) = \left [-\frac {\partial ^2\mathcal {L}}{\partial \theta _i\,\partial \theta _j}\right ]\).
  • The Fisher information is the matrix \(J(\theta )\) with entries \(J_{ij}(\theta ) = E\left [I_{ij}(\theta ; X)\right ]\).

For a regular model \(E\left [S(\theta ; X)\right ] = 0\) and \(J(\theta ) = \var \left [S(\theta ; X)\right ] = E\left [S(\theta ; X)S(\theta ; X)^{\mathsf T}\right ]\), by the argument of theorem 2.2.1 applied to each pair of components. Invariance (theorem 2.1.5) also holds for vector parameters.

Example 2.2.4. Let \(X_1, \dots , X_n\) be a random sample from \(N(\mu , \sigma ^2)\). Find the ML estimator of \(\theta = (\mu , \sigma ^2)^{\mathsf T}\), the score and the Fisher information.

Solution. Write \(\theta _1 = \mu \) and \(\theta _2 = \sigma ^2\). Then \[\mathcal {L}(\theta ) = -\frac n2\ln (2\pi \theta _2) - \frac {1}{2\theta _2}\sum ^n_{i = 1}(x_i - \theta _1)^2,\] and the score is \[S(\theta ) = \begin {pmatrix} \frac {1}{\theta _2}\sum (x_i - \theta _1)\\[1ex] -\frac {n}{2\theta _2} + \frac {1}{2\theta _2^2}\sum (x_i - \theta _1)^2 \end {pmatrix}.\] Setting the first component to zero gives \(\hat \theta _1 = \bar x\); substituting into the second gives \(\hat \theta _2 = \frac 1n\sum (x_i - \bar x)^2\). So \[\hat \theta = \left (\bar X, \frac 1n\sum (X_i - \bar X)^2\right )^{\mathsf T} = \left (\bar X, \frac {n - 1}{n}S^2\right )^{\mathsf T} .\] Differentiating again, \[I(\theta ) = \begin {pmatrix} \frac {n}{\theta _2} & \frac {1}{\theta _2^2}\sum (x_i - \theta _1)\\[1ex] \frac {1}{\theta _2^2}\sum (x_i - \theta _1) & -\frac {n}{2\theta _2^2} + \frac {1}{\theta _2^3}\sum (x_i - \theta _1)^2 \end {pmatrix}.\] Since \(E(X_i - \theta _1) = 0\) and \(E(X_i - \theta _1)^2 = \theta _2\), \[J(\theta ) = \begin {pmatrix} \frac {n}{\theta _2} & 0\\[1ex] 0 & -\frac {n}{2\theta _2^2} + \frac {n}{\theta _2^2} \end {pmatrix} = \begin {pmatrix} \frac {n}{\sigma ^2} & 0\\[1ex] 0 & \frac {n}{2\sigma ^4} \end {pmatrix}.\] At \(\hat \theta \) the off-diagonal entries of \(I\) vanish and the diagonal entries are \(\frac {n}{\hat \sigma ^2}\) and \(\frac {n}{2\hat \sigma ^4}\), so \(I(\hat \theta )\) is positive definite and \(\hat \theta \) is a maximum. The ML estimator of \(\sigma ^2\) is biased, with mean \(\frac {n - 1}{n}\sigma ^2\).

Problem 2.2.1. Let \((X_1, \, X_2, \, X_3) \thicksim MULT(n, \, \theta _1, \, \theta _2, \, \theta _3)\). Find the M.L estimator of \(\theta = (\theta _1, \theta _2)^t\), the score function and the Fisher information. Hint: use \[f_{\theta }(x_1, x_2, x_3) = \frac {n!}{x_1!\, x_2!\, (n - x_1 - x_2)!}\, \theta _1^{x_1}\, \theta _2^{x_2}\, \left (1 - \theta _1 - \theta _2\right )^{n - x_1 - x_2}\]

Show solution

Solution. Write \(\theta _3 = 1-\theta _1-\theta _2\) and \(x_3 = n-x_1-x_2\). Then \[\log L = \text {const} + x_1\log \theta _1 + x_2\log \theta _2 + x_3\log \left (1-\theta _1-\theta _2\right ).\]

Score

\[S_j(\theta ,X) = \frac {X_j}{\theta _j} - \frac {X_3}{1-\theta _1-\theta _2}, \qquad j=1,2 .\]

Maximum likelihood estimator

Setting both components to zero gives \(X_1/\theta _1 = X_2/\theta _2 = X_3/\theta _3\); with \(\theta _1+\theta _2+\theta _3=1\) and \(X_1+X_2+X_3=n\) the common ratio is \(n\), so \[\widehat {\theta }_1 = \frac {X_1}{n},\qquad \widehat {\theta }_2 = \frac {X_2}{n} .\]

Fisher information

Differentiating again, and using \(E(X_j)=n\theta _j\), \[-\frac {\partial ^{2}\log L}{\partial \theta _j^{2}} = \frac {X_j}{\theta _j^{2}} + \frac {X_3}{\theta _3^{2}}, \qquad -\frac {\partial ^{2}\log L}{\partial \theta _1\partial \theta _2} = \frac {X_3}{\theta _3^{2}},\] so \[J(\theta ) = n\begin {pmatrix} \dfrac {1}{\theta _1}+\dfrac {1}{\theta _3} & \dfrac {1}{\theta _3}\\[8pt] \dfrac {1}{\theta _3} & \dfrac {1}{\theta _2}+\dfrac {1}{\theta _3} \end {pmatrix}.\] The off-diagonal entries are not zero: the two estimators are negatively correlated, as they must be, because a larger \(\widehat {\theta }_1\) leaves less probability for \(\theta _2\).

2.2.2 The Likelihood Equation and its Solution

Often the score equation \(S(\theta ) = 0\) has no closed-form solution and must be solved numerically. Newton’s method (the Newton–Raphson method) starts from an approximate value \(\theta ^{(0)}\) and updates it by \begin {equation} \label {eq:newton} \theta ^{(i + 1)} = \theta ^{(i)} + \frac {S\left (\theta ^{(i)}\right )}{I\left (\theta ^{(i)}\right )},\qquad i = 0, 1, 2, \dots , \end {equation} until successive values agree to the required accuracy. In the multiparameter case the update is \[\theta ^{(i + 1)} = \theta ^{(i)} + \left [I\left (\theta ^{(i)}\right )\right ]^{-1}S\left (\theta ^{(i)}\right ).\] Replacing the observed information \(I\) by the Fisher information \(J\) gives Fisher’s method of scoring, which is often more stable because \(J\) is positive definite.

The update comes from linearising the score about the current value. By Taylor’s theorem \(S(\theta )\approx S(\theta ^{(i)}) + (\theta - \theta ^{(i)})S'(\theta ^{(i)})\), and \(S' = -I\). Setting the approximation to zero and solving for \(\theta \) gives (2.2). If the starting value is close enough to a root at which \(I>0\), the iteration converges, and the number of correct digits roughly doubles at each step.

Example 2.2.5. Let \(X_1, \dots , X_n\) be a random sample from the Weibull distribution \(f_\theta (x) = \theta x^{\theta - 1}e^{-x^\theta }\), \(x>0\), \(\theta >0\). Explain how to find the ML estimate of \(\theta \), and carry out the method for the data \(0.6,\ 1.2,\ 0.9,\ 1.8,\ 0.4\).

Solution. \[\mathcal {L}(\theta ) = n\ln \theta + (\theta - 1)\sum \ln x_i - \sum x_i^\theta ,\] \[S(\theta ) = \frac n\theta + \sum \ln x_i - \sum x_i^\theta \ln x_i,\qquad I(\theta ) = \frac {n}{\theta ^2} + \sum x_i^\theta (\ln x_i)^2 .\] The equation \(S(\theta ) = 0\) cannot be solved explicitly, but \(I(\theta )>0\) for every \(\theta \), so \(\mathcal {L}\) is strictly concave and has exactly one maximum, which (2.2) finds from any reasonable start.

For the data, \(n = 5\) and \(\sum \ln x_i = -0.7624\). Starting at \(\theta ^{(0)} = 1\):

\(i\) \(\theta ^{(i)}\) \(S(\theta ^{(i)})\) \(I(\theta ^{(i)})\)
0 1.0000 3.7287 6.1642
1 1.6049 1.1236 3.1904
2 1.9571 0.1012 2.6892
3 1.9947 0.0006 2.6586
4 1.9949 0.0000 2.6584

So \(\hat \theta = 1.995\), and \(\frac {1}{\sqrt {I(\hat \theta )}} = 0.613\) is its approximate standard error (section 2.5).

Example 2.2.6. Let \(X_1, \dots , X_n\) be a random sample from \(\text {GAM}(\alpha , \beta )\), with \(\theta = (\alpha , \beta )^{\mathsf T}\). Explain how to obtain the ML estimate, and find the Fisher information.

Solution. \[\mathcal {L}(\theta ) = (\alpha - 1)\sum \ln x_i - \frac 1\beta \sum x_i - n\alpha \ln \beta - n\ln \Gamma (\alpha ).\] With \(\psi (\alpha ) = \frac {d}{d\alpha }\ln \Gamma (\alpha )\), the digamma function, the score is \[S(\theta ) = \begin {pmatrix} \sum \ln x_i - n\ln \beta - n\psi (\alpha )\\[1ex] \frac {1}{\beta ^2}\sum x_i - \frac {n\alpha }{\beta } \end {pmatrix}.\] The second equation gives \(\beta = \frac {\bar x}{\alpha }\); substituting into the first leaves the single equation \[\ln \alpha - \psi (\alpha ) = \ln \bar x - \frac 1n\sum \ln x_i ,\] which has no closed-form solution and is solved by Newton’s method. (The right side is the log of the ratio of the arithmetic to the geometric mean, which is positive unless all the \(x_i\) are equal.) The information matrix is \[I(\theta ) = \begin {pmatrix} n\psi '(\alpha ) & \frac n\beta \\[1ex] \frac n\beta & \frac {2}{\beta ^3}\sum x_i - \frac {n\alpha }{\beta ^2} \end {pmatrix},\] and since \(E\left (\sum X_i\right ) = n\alpha \beta \), \[J(\theta ) = n\begin {pmatrix} \psi '(\alpha ) & \frac 1\beta \\[1ex] \frac 1\beta & \frac {\alpha }{\beta ^2} \end {pmatrix}.\] Here \(\psi '\) is the trigamma function. The iteration is \(\theta ^{(i+1)} = \theta ^{(i)} + \left [I(\theta ^{(i)})\right ]^{-1}S(\theta ^{(i)})\), started for example from the method of moments estimates \(\alpha ^{(0)} = \frac {\bar x^2}{s^2}\) and \(\beta ^{(0)} = \frac {s^2}{\bar x}\).

Problem 2.2.2. Suppose \(X_1, \, \cdots \, , \, X_n\) is a random sample from the distribution with pdf \[f_{\theta }(x) = \frac {\alpha \beta }{\left (1 + \beta x\right )^{\alpha + 1}}\quad , \quad x > 0;\quad \alpha , \, \beta > 0\] Explain how you find the \(M.L\) estimate of \(\theta = (\alpha , \beta )^t\). Find the Fisher information.

Show solution

Solution.

Finding the estimate

\[\log L = n\log \alpha + n\log \beta - (\alpha +1)\sum _{i=1}^{n}\log \left (1+\beta x_i\right ).\] Differentiating, \[\frac {\partial \log L}{\partial \alpha } = \frac {n}{\alpha } - \sum _{i=1}^{n}\log \left (1+\beta x_i\right ), \qquad \frac {\partial \log L}{\partial \beta } = \frac {n}{\beta } - (\alpha +1)\sum _{i=1}^{n}\frac {x_i}{1+\beta x_i}.\] The first equation solves explicitly for \(\alpha \) in terms of \(\beta \), \[\widehat {\alpha }(\beta ) = \frac {n}{\sum _{i=1}^{n}\log \left (1+\beta x_i\right )} .\] Substituting this into the second leaves a single equation in \(\beta \) alone, which has no closed-form solution and must be solved numerically — Newton’s method or a one-dimensional search. Once \(\widehat {\beta }\) is found, \(\widehat {\alpha }=\widehat {\alpha }(\widehat {\beta })\). This is the standard profile-likelihood device: eliminate the parameter that can be eliminated, and search over what is left.

Fisher information

The calculation is short once one notices that \[U = \log \left (1+\beta X\right ) \sim \text {EXP}(\alpha ),\] since \(P(X>x) = (1+\beta x)^{-\alpha }\) gives \(P(U>t)=e^{-\alpha t}\). Writing \(V=1+\beta X=e^{U}\), we get \(E\left (V^{-1}\right )=\alpha /(\alpha +1)\) and \(E\left (V^{-2}\right )=\alpha /(\alpha +2)\), whence \[E\left (\frac {X}{1+\beta X}\right ) = \frac {1}{\beta }\left (1-\frac {\alpha }{\alpha +1}\right ) = \frac {1}{\beta (\alpha +1)},\] \[E\left (\frac {X^{2}}{\left (1+\beta X\right )^{2}}\right ) = \frac {1}{\beta ^{2}}\left (1 - \frac {2\alpha }{\alpha +1} + \frac {\alpha }{\alpha +2}\right ) = \frac {2}{\beta ^{2}(\alpha +1)(\alpha +2)} .\] Taking second derivatives and expectations, \[J(\theta ) = n\begin {pmatrix} \dfrac {1}{\alpha ^{2}} & \dfrac {1}{\beta (\alpha +1)}\\[8pt] \dfrac {1}{\beta (\alpha +1)} & \dfrac {\alpha }{\beta ^{2}(\alpha +2)} \end {pmatrix}.\]

Questions on this section

Stuck on something here? Ask below and it stays attached to this topic.