Tutorials › Statistical Theory II - Mathematical Statistics and Statistical Inference › Expected And Observed Information In Efficiency Calculations

Asymptotic Efficiency · Tutorial 870 of 970

Expected And Observed Information In Efficiency Calculations

Learn which information quantity defines an asymptotic efficiency bound, how observed information estimates it, and why they cannot be interchanged indiscriminately.

Advanced 10 min read

What You'll Learn

  • Define expected Fisher information and observed information for scalar and vector parameters
  • Derive the information identity from regularity conditions
  • Distinguish sample information from per-observation information
  • Use expected information in first-order asymptotic variance calculations
  • Explain when observed information can estimate expected information
  • Diagnose misleading comparisons between realized curvature and an efficiency bound

Why Two Information Quantities?

Likelihood curvature measures how sharply a likelihood changes near a parameter value. But there are two related quantities to distinguish: expected Fisher information, which averages over possible samples under the model, and observed information, which is calculated from the sample actually obtained. They may be close in a large sample, but they are generally not the same number for a particular data set.

The distinction matters in first-order efficiency calculations. Under standard regularity conditions, expected information determines the asymptotic variance bound for regular estimators. Observed information is often useful as a data-based estimate of that bound, but the realized curvature is not itself the definition of the bound. In what follows, \(I(\theta)\) denotes information per observation and \(I_n(\theta)\) denotes expected information for a sample of size \(n\).

Definitions and the Information Identity

Suppose \(X_1,\ldots,X_n\) are independent and identically distributed with density or mass function \(f(x;\theta)\), where \(\theta\) is a scalar parameter in an open subset of the real line. Write the log-likelihood as \(\ell_n(\theta)=\sum_{i=1}^n \log f(X_i;\theta)\). The score is the derivative of the log-likelihood, and observed information is its negative second derivative.

Definition: The score from one observation is \(u(X;\theta)=\partial \log f(X;\theta)/\partial\theta\). The expected Fisher information per observation is \(I(\theta)=E_\theta[u(X;\theta)^2]\), when this expectation is finite. The observed information in a sample is \(J_n(\theta)=-\partial^2\ell_n(\theta)/\partial\theta^2\). The expected information in the sample is \(I_n(\theta)=E_\theta[J_n(\theta)]=nI(\theta)\), when the information identity applies.

The expectation in \(I(\theta)\) is taken over the distribution of \(X\) at the specified value of \(\theta\). In contrast, \(J_n(\theta)\) depends on the observed values \(X_1,\ldots,X_n\). For a vector parameter, the score is a column vector and the definitions become \(I(\theta)=E_\theta[u(X;\theta)u(X;\theta)^\mathsf{T}]\) and \(J_n(\theta)=-\nabla^2\ell_n(\theta)\); these are matrices.

The following identity is central to the distinction. It requires regularity; it should not be assumed merely because a likelihood can be differentiated. For a discrete model, sums replace the integrals below.

Theorem (Information identity): Suppose the model has common support not depending on \(\theta\), \(f(x;\theta)\) is twice differentiable in \(\theta\), and differentiation can be interchanged with integration for both the normalizing integral and its first two derivatives. Suppose also that the score has finite second moment. Then \(E_\theta[u(X;\theta)]=0\) and \[ I(\theta)=E_\theta[u(X;\theta)^2] =-E_\theta\left[\frac{\partial^2}{\partial\theta^2}\log f(X;\theta)\right]. \]

Proof. Since the density integrates to one, the assumed interchange of differentiation and integration gives \(\int f(x;\theta)\,dx=1\), \(\int \partial f(x;\theta)/\partial\theta\,dx=0\), and \(\int \partial^2 f(x;\theta)/\partial\theta^2\,dx=0\). Where \(f\) is positive, the score is \(u=(\partial f/\partial\theta)/f\). Therefore \[ E_\theta[u(X;\theta)] =\int \frac{\partial f(x;\theta)}{\partial\theta}\,dx=0. \] Also, differentiating the logarithm twice gives \[ \frac{\partial^2}{\partial\theta^2}\log f =\frac{\partial^2 f/\partial\theta^2}{f} -\left(\frac{\partial f/\partial\theta}{f}\right)^2. \] Multiplying by \(f\), integrating, and using \(\int \partial^2 f/\partial\theta^2\,dx=0\) yields \[ E_\theta\left[\frac{\partial^2}{\partial\theta^2}\log f(X;\theta)\right] =-\int \frac{(\partial f(x;\theta)/\partial\theta)^2}{f(x;\theta)}\,dx =-E_\theta[u(X;\theta)^2]. \] All integrals are well-defined under the stated conditions. This proves the identity. \(\square\)

For independent observations, additivity gives \(J_n(\theta)=\sum_{i=1}^n -\partial^2\log f(X_i;\theta)/\partial\theta^2\), and hence \(E_\theta[J_n(\theta)]=nI(\theta)\). The identity equates an expectation of curvature with a variance-like score quantity; it does not say that the curvature for each realized observation equals its expectation.

Worked Examples: Realized Information Can Differ

Worked Example: Bernoulli Information Depends on the Observed Count

Let \(X_i\) be Bernoulli with success probability \(p\), and let \(S=\sum_{i=1}^n X_i=s\). The log-likelihood, apart from no omitted \(p\)-dependent terms, is \[ \ell_n(p)=s\log p+(n-s)\log(1-p). \] Differentiating twice, \[ \ell_n''(p)=-\frac{s}{p^2}-\frac{n-s}{(1-p)^2}, \qquad J_n(p)=\frac{s}{p^2}+\frac{n-s}{(1-p)^2}. \] For one observation the score is \((X-p)/(p(1-p))\), whose squared expectation is \(1/[p(1-p)]\). Thus \(I_n(p)=n/[p(1-p)]\).

Take \(n=10\) and \(s=5\). At \(p=0.5\), the observed information is \(5/0.25+5/0.25=20+20=40\), and the expected information is \(10/0.25=40\). Here they happen to agree. At \(p=0.2\), using the same realized count, the observed information is \(5/0.04+5/0.64=125+7.8125=132.8125\). The expected information at \(p=0.2\) is \(10/(0.2\cdot0.8)=10/0.16=62.5\).

There is no contradiction: the observed value uses the actual count \(s=5\), while expected information averages over all possible counts generated when \(p=0.2\). Also, for this particular sample the maximum likelihood estimate is \(\hat p=s/n=0.5\), so evaluating observed information at \(p=0.2\) is not the same operation as evaluating it at the fitted value.

Worked Example: Normal Mean with Known Variance

Suppose \(X_i\sim N(\mu,\sigma^2)\), where \(\sigma^2\) is known and \(\mu\) is the parameter. The log-likelihood is \[ \ell_n(\mu)=-\frac{n}{2}\log(2\pi\sigma^2)-\frac{1}{2\sigma^2}\sum_{i=1}^n(X_i-\mu)^2. \] Its second derivative is \(\ell_n''(\mu)=-n/\sigma^2\), so \(J_n(\mu)=n/\sigma^2\) for every sample and every \(\mu\). The score from one observation is \((X-\mu)/\sigma^2\), whose squared expectation is \(\sigma^2/\sigma^4=1/\sigma^2\). Consequently \(I_n(\mu)=n/\sigma^2\).

In this model the observed and expected information agree exactly, rather than just approximately. That is a special feature of the likelihood's curvature, not a general rule. The maximum likelihood estimator is \(\bar X\), and its variance is \(\sigma^2/n=I_n(\mu)^{-1}\), illustrating the familiar first-order information calculation in a case where the finite-sample variance also matches it.

Worked Example: Poisson Rate and a Random Observed Curvature

Let \(X_i\sim\operatorname{Poisson}(\lambda)\), with \(\lambda>0\), and write \(S=\sum_i X_i\). The log-likelihood is \(\ell_n(\lambda)=S\log\lambda-n\lambda-\sum_i\log(X_i!)\). Therefore \[ J_n(\lambda)=-\ell_n''(\lambda)=\frac{S}{\lambda^2}, \qquad I_n(\lambda)=\frac{n}{\lambda}, \] because \(E_\lambda[S]=n\lambda\).

For \(n=4\), data \(1,2,0,1\) give \(S=4\). At the true or candidate value \(\lambda=2\), the observed information is \(4/2^2=1\), while the expected information is \(4/2=2\). The maximum likelihood estimate is \(\hat\lambda=S/n=1\); at that value the observed information is \(4/1^2=4\). Thus the information value depends both on the realized sample and on the parameter value at which curvature is evaluated.

Information in First-Order Efficiency Calculations

Expected information, rather than the observed curvature of one sample, defines the usual first-order efficiency benchmark in a regular correctly specified likelihood model. In the scalar case, suppose the true parameter \(\theta_0\) is an interior point, \(0<I(\theta_0)<\infty\), and the usual differentiability, identifiability, and likelihood regularity conditions for maximum likelihood asymptotic normality hold. Then a consistent maximum likelihood estimator satisfies \[ \sqrt{n}(\hat\theta-\theta_0)\xrightarrow{d}N\left(0,I(\theta_0)^{-1}\right). \] The asymptotic variance of \(\hat\theta\) on the \(1/\sqrt n\) scale is therefore \(I(\theta_0)^{-1}\), and its approximate variance at sample size \(n\) is \(1/[nI(\theta_0)]\). For regular estimators in the same model, this is the corresponding scalar information-bound benchmark when the bound applies.

This statement concerns a repeated-sampling limit at the true parameter. It is not a claim that the variance of an estimator in every finite sample equals the inverse observed information, nor does it cover irregular situations in which the information bound fails. In a vector model, replace \(I(\theta_0)^{-1}\) by the inverse information matrix, assuming it is nonsingular; parameter-specific bounds may then be obtained from that matrix.

Theorem (Observed information as a consistent estimate): Suppose the model is iid and regular, and the per-observation negative log-likelihood second derivative \(j(X;\theta_0)=-\partial^2\log f(X;\theta_0)/\partial\theta^2\) has finite expectation. Then, by the law of large numbers, \(J_n(\theta_0)/n\xrightarrow{p}E_{\theta_0}[j(X;\theta_0)]=I(\theta_0)\), where the last equality follows from the information identity. If in addition \(\hat\theta\xrightarrow{p}\theta_0\) and a suitable uniform law of large numbers and continuity condition hold near \(\theta_0\), then \(J_n(\hat\theta)/n\xrightarrow{p}I(\theta_0)\).

Proof. At the fixed true value, \(J_n(\theta_0)/n=n^{-1}\sum_{i=1}^n j(X_i;\theta_0)\). The summands are iid with finite expectation, so the law of large numbers gives convergence in probability to \(E_{\theta_0}[j(X;\theta_0)]\). By the information identity this expectation is \(I(\theta_0)\). For evaluation at \(\hat\theta\), pointwise convergence at \(\theta_0\) alone is insufficient because the evaluation point is random. The additional uniform law of large numbers controls the empirical average uniformly in a neighborhood of \(\theta_0\); consistency places \(\hat\theta\) in that neighborhood with probability tending to one, and continuity makes the limiting expectation at \(\hat\theta\) converge to its value at \(\theta_0\). Thus the plug-in convergence follows under the stated additional conditions. \(\square\)

The practical role of observed information follows: \(J_n(\hat\theta)^{-1}\), when well-defined, is commonly used to estimate the asymptotic covariance matrix of a maximum likelihood estimator. It is useful because it is calculable from the fitted model and the observed data. Its justification is consistency toward the expected information under appropriate conditions, not equality in every sample. Expected information is the theoretical target for a first-order efficiency comparison; observed information is a sample-dependent estimate of that target.

Common Mistake: Substituting Realized Curvature for the Bound

A common error is to calculate \(J_n(\hat\theta)\) for one data set and call its inverse the exact efficiency bound, then compare another estimator's finite-sample variance directly with that number. This mixes three different objects: an asymptotic bound defined through expected information, a random estimate of that information, and an estimator's finite-sample variance. They need not be equal.

The correction is to state which quantity is being used and why. For a theoretical first-order calculation, use \(I(\theta_0)\) (or \(nI(\theta_0)\) for the full sample) to obtain the asymptotic variance benchmark. For an estimated standard error, one may use observed information at a consistent fitted value, while recognizing that it is random and only asymptotically justified under regularity. If observed and expected information differ materially in a small sample, that is not an algebraic inconsistency: it may indicate ordinary sample variation, and it can also prompt a check of the model and calculation.

Key takeaway: Expected information averages over repeated samples and supplies the standard first-order efficiency benchmark. Observed information is the realized likelihood curvature. Use it as a data-based estimate when justified, but do not silently replace the theoretical expectation by a single sample's curvature.

Check Your Understanding

Answer each question by identifying whether it concerns expected information, observed information, or the relation between them.

  1. For an iid regular model, what is the difference between \(I(\theta)\) and \(J_n(\theta)\)? Include which one is random across samples.
  2. In the Bernoulli example with \(n=10\), \(s=5\), and \(p=0.2\), calculate the observed and expected information, and explain why they differ.
  3. What regularity feature is needed to justify replacing the expectation of the log-likelihood's second derivative by the negative expected curvature?
  4. Why does the convergence \(J_n(\theta_0)/n\xrightarrow{p}I(\theta_0)\) not by itself prove the same result at a random \(\hat\theta\)?
  5. Under what interpretation is inverse observed information at a fitted value useful in an efficiency calculation?
Clinical Biostats