Tutorials › Pattern-Mixture and Selection Models › Worked Diagnosis of an Unstable Likelihood Fit

Likelihood Inference and Instability · Tutorial 140 of 499

Worked Diagnosis of an Unstable Likelihood Fit

Learn to diagnose an unstable selection-model fit by combining optimization, curvature, and profile-likelihood evidence rather than relying on a single convergence flag.

Advanced 12 min read

What You'll Learn

  • Specify an observed-data likelihood for a longitudinal selection model with dropout after baseline.
  • Compare optimizer starts to distinguish a stable maximum from a competing local maximum.
  • Interpret likelihood contours and Hessian eigenvalues, including a near-zero eigenvalue.
  • Calculate and interpret a likelihood-ratio profile interval for a dropout parameter.
  • Use diagnostics together to identify weak identification and choose a cautious next step.

Why diagnose the fit as a whole?

A selection-model likelihood can be numerically maximized even when the data provide little information about how dropout depends on an unobserved outcome. In that situation, the optimizer may report convergence, yet different starting values can lead to different solutions, the likelihood can be nearly flat along a curved direction, and a Wald standard error can be misleading. A useful diagnosis therefore combines evidence from several views of the same fitted likelihood: optimizer starts, contours, local curvature, and profiles.

The worked case below is hypothetical. It describes a longitudinal study in which every participant has a baseline outcome, but some participants drop out before the follow-up outcome is measured. Outcomes are expressed in standard-deviation units. The goal is not to decide whether the selection model is true; it is to assess whether its likelihood supports stable estimation of the dropout parameter.

Model and likelihood for the example

Definition: Let \(Y_{i1}\) and \(Y_{i2}\) be participant \(i\)'s baseline and follow-up outcomes, and let \(R_i=1\) if follow-up is observed and \(R_i=0\) if it is missing. Assume independent participants, a bivariate normal model for \((Y_{i1},Y_{i2})\), and a logistic selection model \(P(R_i=1\mid Y_{i1},Y_{i2})=\operatorname{logit}^{-1}(\gamma_0+\gamma_1Y_{i1}+\gamma_2Y_{i2})\). Here \(\gamma_2\) is the log-odds change in follow-up observation per one-unit increase in the follow-up outcome, conditional on baseline. The model allows dropout to depend on the unobserved follow-up outcome.

The bivariate normal distribution specifies the joint outcome density \(f(y_1,y_2)\). For a participant with observed follow-up, the likelihood contribution is the joint outcome density multiplied by the probability of observation. For a participant who dropped out, the follow-up value is unavailable, so its contribution integrates over all possible follow-up values:

$$ L_i = \begin{cases} f(y_{i1},y_{i2})\,\pi(y_{i1},y_{i2}), & R_i=1,\\[4pt] \displaystyle\int f(y_{i1},y_2)\{1-\pi(y_{i1},y_2)\}\,dy_2, & R_i=0, \end{cases} \qquad \pi(y_1,y_2)=\operatorname{logit}^{-1}(\gamma_0+\gamma_1y_1+\gamma_2y_2). $$

The observed-data log likelihood is \(\ell(\theta)=\sum_i\log L_i\), where \(\theta\) collects the outcome and selection parameters. The integral must be evaluated numerically in this example; the diagnosis assumes that quadrature accuracy has already been checked. The results also assume that the optimizer is being applied to the intended likelihood, with parameters and outcome scaling implemented consistently. A failed check of either assumption can mimic statistical instability.

Compare starts before trusting a reported solution

A convergence message says that an algorithm met its stopping rule; it does not establish that it found the global maximum or that the parameters are well identified. Multiple starts should vary the initial selection parameters meaningfully, not just perturb the outcome parameters around one initial point. Compare the final log likelihoods and estimates, and inspect whether convergence was to an interior stationary point.

Worked Example: Reading the optimizer starts

Suppose the hypothetical study has 240 participants: 168 with observed follow-up and 72 who dropped out. Four runs use different initial values for the selection parameters. The optimizer reports the following results, with all runs using the same checked likelihood calculation.

RunInitial \(\gamma_2\)Final \(\hat{\gamma}_2\)Final \(\hat{\mu}_2\)Final \(\ell\)
A-2.0-0.380.42-412.683
B0.0-0.410.44-412.681
C2.01.85-0.06-414.200
D5.0-0.400.43-412.681

Runs B and D have the largest reported log likelihood, \(-412.681\); run A is only 0.002 lower. Their estimates are close, so these starts appear to have reached the same high-likelihood region. Run C has a lower log likelihood by \( -412.681-(-414.200)=1.519\), and its estimates differ substantially. This is evidence of a competing inferior solution, consistent with a local maximum or an optimizer that stopped prematurely. It is not evidence that the run-C estimates are an equally good explanation of the data.

The next check is to restart from run C's final estimates using tighter optimization settings and, if appropriate, different algorithms. If it reliably returns to the same inferior point while the other starts return to the higher likelihood, a distinct local maximum is more plausible. If it moves to the best solution, the earlier run may simply have stopped too soon. The start comparison alone cannot distinguish those possibilities.

The absolute log-likelihood values are meaningful only for comparing fits to the same data under the same likelihood definition. Also, starts that converge to one solution do not prove that no other maximum exists. They provide evidence about the region explored, not a global guarantee.

Contours and local curvature reveal different features

A likelihood contour shows combinations of parameters with similar log likelihood. A narrow, elongated contour indicates that some combinations are much better determined than others. If increasing \(\gamma_2\) can be offset by changing the follow-up mean \(\mu_2\), for example, the likelihood may change very little along a diagonal path. This is a ridge: the parameter pair is weakly identified jointly, even if the likelihood has a well-defined maximum.

The observed information matrix at a fitted point is \(J(\hat{\theta})=-H(\hat{\theta})\), where \(H\) is the Hessian matrix of second derivatives of the log likelihood. Its eigenvectors give local directions in parameter space, and its eigenvalues give curvature in those directions. On a locally concave log likelihood at a local maximum, the Hessian is negative semidefinite and the observed information is positive semidefinite. Thus its eigenvalues are nonnegative; they are all positive only if the Hessian is negative definite at the fitted point. A zero eigenvalue indicates a locally flat direction, while a small positive eigenvalue indicates weak local curvature. A negative eigenvalue may signal that the point is not a local maximum, or that numerical derivative error needs investigation.

Worked Example: Interpreting the smallest eigenvalue

At the best fit from runs B and D, suppose the observed information is computed using scaled parameter coordinates. Its eigenvalues are \(0.0008,\ 0.06,\ 0.31,\ 1.2,\ 3.8,\ 11.4,\) and \(25.0\). The eigenvector associated with \(0.0008\) has its largest components in the \(\mu_2\) and \(\gamma_2\) coordinates, with opposite signs.

All seven eigenvalues are positive, so the computed information is positive definite at this point. However, the smallest is far below the largest: \(0.0008/25.0=0.000032\). This very small ratio signals a direction with exceptionally weak curvature. Because the corresponding eigenvector combines \(\mu_2\) and \(\gamma_2\), the local contour should be elongated along a trade-off between the outcome mean and the dropout association.

This finding is compatible with near non-identification, not proof of exact non-identification. The positive eigenvalue means there is some computed local curvature in that direction; an exactly flat direction would give a zero eigenvalue in exact arithmetic. The result should also be checked under sensible parameter scaling and with accurate numerical derivatives: eigenvalues depend on coordinate scaling, and numerical error can distort a very small eigenvalue.

A contour plot and an eigenanalysis complement one another. The contour displays the shape over a chosen two-parameter slice; the Hessian summarizes curvature locally in the full parameter space. A reassuring contour in one slice cannot rule out a flat direction involving other parameters, and a local Hessian does not show whether the likelihood bends, levels off, or turns elsewhere.

Use a profile likelihood to examine the weak parameter

For a parameter of interest such as \(\gamma_2\), the profile log likelihood at a fixed value \(g\) is the largest log likelihood achievable by varying all nuisance parameters while setting \(\gamma_2=g\). This reoptimization matters: simply holding nuisance estimates fixed can exaggerate how much the likelihood changes. A nominal 95% likelihood-ratio profile interval includes values satisfying \(2\{\ell(\hat{\theta})-\ell_{\mathrm{prof}}(g)\}\leq 3.841\), using the one-degree-of-freedom chi-square cutoff. This calibration is an approximation and needs regularity conditions; if those conditions are doubtful, calibration by an appropriate parametric bootstrap is a possible alternative.

Worked Example: Computing profile-interval endpoints

Suppose the best log likelihood is \(-412.681\), and profiling \(\gamma_2\) gives log likelihood \(-414.601\) at both \(g=-2.7\) and \(g=4.9\). At those values, the reoptimized follow-up mean estimates are respectively \(1.10\) and \(-0.28\) standard-deviation units. The likelihood-ratio statistic at either endpoint is

$$ 2\{\ell(\hat{\theta})-\ell_{\mathrm{prof}}(g)\} =2\{-412.681-(-414.601)\} =2(1.920) =3.840. $$

Because \(3.840\) is approximately the 95% cutoff \(3.841\), these values are approximate endpoints of the nominal profile interval, \([-2.7,4.9]\). The interval is broad and spans both negative and positive dropout associations. In context, the data have not pinned down whether a one-standard-deviation higher unobserved follow-up outcome is associated with lower or higher odds of follow-up observation, conditional on baseline. The endpoint mean estimates also show how nuisance parameters can move as \(\gamma_2\) varies along a likelihood ridge.

This interval is not a 95% probability statement about the fixed parameter. It is a confidence procedure with nominal coverage under the model and the calibration assumptions. Its breadth is evidence that the likelihood supplies limited information about \(\gamma_2\), not evidence that every value in the interval is equally plausible.

Bring the diagnostics together

For the hypothetical fit, the best starts give almost identical estimates and log likelihoods, while one start finds a substantially inferior solution. That calls for checking the competing solution, but it does not by itself invalidate the best fit. The small positive information eigenvalue and the elongated \((\mu_2,\gamma_2)\) contour indicate a weakly curved trade-off near that fit. The broad, asymmetric profile interval then shows that substantial changes in \(\gamma_2\) can be accommodated by reoptimizing other parameters.

These findings are consistent with a likelihood that has a high-likelihood region but weak information about the dropout association. They do not establish which mechanism produced the instability. Possible contributors include weak identification from the observed data, a nearby competing maximum, poor parameter scaling, inaccurate numerical integration, or derivative error. The checks should be targeted accordingly: verify the likelihood and quadrature, compare starts and optimization settings, inspect contours, and check local curvature and profiles. Do not interpret convergence alone as evidence that all parameters are well determined.

A Wald interval relies on a local quadratic approximation and the inverse observed information. Near a ridge, that approximation can be unrepresentative over the parameter range of interest, even when the optimizer reports a maximum. The profile interval instead allows nuisance parameters to adjust at each fixed value of the parameter of interest. Neither approach removes weak information from the data. Profile methods can also be unreliable if optimization fails at fixed parameter values or if the likelihood-ratio calibration is poor. A parametric bootstrap can assess calibration or sampling behavior under a specified fitted model, but it cannot make an uninformative likelihood informative.

Common pitfall and practical limits

Common pitfall: “The optimizer converged, and the information matrix has positive eigenvalues, so the estimates are stable.” This reasoning is incomplete. Convergence only reports an algorithmic stopping condition; positive eigenvalues can include a value extremely close to zero. Check their magnitudes and directions, compare multiple starts and the resulting likelihoods, and examine profiles for the parameters that matter.

A diagnosis is conditional on the model and computational implementation. The bivariate normal outcome assumption, logistic dropout model, independence across participants, and numerical integration all matter. If the outcome distribution or selection mechanism is misspecified, a stable maximum can still answer the wrong model-based question. Conversely, an unstable selection parameter need not make every estimand unusable: report which quantities are weakly supported, and avoid presenting a precise interpretation of an uncertain dropout mechanism. The model remains a sensitivity framework, not a guarantee that missing outcomes have been recovered from the observed data.

1
Check the computational target.
Confirm the observed-data likelihood, parameterization, scaling, and numerical integration accuracy before interpreting optimizer behavior.
2
Compare distinct starts.
Record final likelihoods and estimates; investigate materially different solutions and verify whether apparent convergence is reproducible.
3
Inspect local and global shape.
Use contours and scaled Hessian eigenpairs to find weak directions, then use profile likelihood to assess how far the likelihood supports the target parameter.

Check Your Understanding

Answer each question, then compare with the solutions below.

  1. Why does a convergence message not establish that a selection-model fit is stable?
  2. At a local maximum, must every observed-information eigenvalue be strictly positive? State what a zero eigenvalue would indicate.
  3. A profile log likelihood is \(-420.0\) at a fixed parameter value, and the maximized log likelihood is \(-418.2\). Calculate the likelihood-ratio statistic and compare it with 3.841.
  4. What does a broad profile interval for \(\gamma_2\) say about the data, and what does it not say?

Solutions. (1) Convergence means the algorithm met its stopping rule; it does not rule out other maxima or a nearly flat likelihood direction. Compare starts and inspect curvature and profiles. (2) No. At a locally concave maximum, eigenvalues are nonnegative; a zero eigenvalue indicates a flat local direction, while strict positivity requires negative definiteness of the log-likelihood Hessian. (3) \(2\{ -418.2-(-420.0)\}=2(1.8)=3.6\), which is below 3.841, so the value is inside the nominal 95% profile-likelihood set. (4) It indicates limited likelihood information about the dropout association under the fitted model. It does not assign a probability to the fixed parameter or establish that the selection model is correct.

Clinical Biostats