Why Inspect Curvature After a Fit?
A fitted joint model can return parameter estimates even when the uncertainty attached to them is unreliable. The fitted values describe a location in parameter space; the local curvature of the objective describes how sharply the likelihood distinguishes nearby values. If the likelihood is nearly flat in some direction, small numerical changes can produce large changes in estimated uncertainty. If the curvature has the wrong sign at a claimed interior maximum, the fit may not be at a local maximum at all.
Hessian diagnostics are therefore a check on the local geometry behind standard errors, not a proof that the model is correctly specified or that its parameters are practically identifiable. They complement checks of the reported gradient and the earlier material on structural and practical identifiability.
Hessian and Observed Information
Let \(\theta=(\theta_1,\ldots,\theta_p)^\mathsf{T}\) be the vector of free model parameters, and let \(\ell(\theta)\) be the log-likelihood being optimized. In a joint model, this is typically the likelihood for the observed longitudinal and event data, with latent random effects integrated out or otherwise handled by the specified estimation method. At a fitted estimate \(\hat{\theta}\), the Hessian is the matrix of second derivatives:
Here \(J(\hat{\theta})\) is the observed information. For an unconstrained, regular, interior maximum, the likelihood should curve downward locally: \(H\) is negative definite, equivalently \(J\) is positive definite. Positive definiteness means \(v^\mathsf{T}Jv>0\) for every nonzero direction \(v\). The fitted maximum should also have a gradient near zero; curvature cannot compensate for a fit that has not reached a stationary point.
This approximation relies on a smooth likelihood, a well-defined interior maximum, local identifiability, a nonsingular information matrix, and the usual large-sample regularity conditions. It is a local, approximately normal description of sampling uncertainty. It is not appropriate to interpret an inverse as a trustworthy covariance estimate merely because software was able to calculate one.
Why the Inverse Information Gives a Local Uncertainty Estimate
Write \(\delta=\theta-\hat{\theta}\). A second-order Taylor expansion around a stationary estimate gives a local approximation:
Thus, the local log-likelihood drops according to the quadratic form involving \(J\). Under the usual likelihood approximation, the corresponding likelihood contours are approximately ellipses, and the covariance matrix describing their local scale is \(J^{-1}\). A direction with small information has a large variance in the inverse. This also explains why strong correlation between parameters can make individual standard errors large: uncertainty may be concentrated along a particular combination of parameters.
The approximation is local. It can be misleading if the likelihood is skewed, has multiple separated modes, approaches a parameter boundary, or is so flat that higher-order terms matter over the range of plausible values.
Worked Example: Computing Standard Errors From a Positive-Definite Matrix
Suppose a hypothetical joint-model fit estimates \(\theta=(\beta_L,\alpha)^\mathsf{T}\), where \(\beta_L\) is a longitudinal mean slope in standardized biomarker units per year and \(\alpha\) is a dimensionless association parameter. The estimated observed information is
The leading diagonal entry is positive, and the determinant is \(100(25)-20^2=2100>0\); therefore this symmetric \(2\times2\) matrix is positive definite. Its inverse is
The standard errors are the square roots of the diagonal entries: \(SE(\hat{\beta}_L)=\sqrt{0.01190}=0.1091\) standardized biomarker units per year, and \(SE(\hat{\alpha})=\sqrt{0.04762}=0.2182\). The negative covariance indicates that, locally, higher values of one estimate tend to accompany lower values of the other. These calculations support a local uncertainty estimate only if the fit is an interior maximum and the likelihood approximation is adequate.
Definiteness and Conditioning Are Different Checks
Definiteness asks whether the curvature has the correct sign in every direction. Conditioning asks how sensitive matrix inversion is to small perturbations. A matrix can be positive definite yet so poorly conditioned that its inverse is unstable. For a symmetric positive-definite matrix, its eigenvalues are positive. A very small eigenvalue indicates a direction with little curvature; the condition number, commonly the largest eigenvalue divided by the smallest, summarizes the relative disparity in curvature.
Eigenvectors help locate the combinations of parameters that are weakly informed. Inspecting only the diagonal of \(J\) can miss this: two parameters may each appear to have substantial curvature while a contrast between them is nearly flat. The eigenvalue scale also depends on parameter units. Rescaling parameters can improve numerical conditioning, but it cannot create information that the data do not contain.
Worked Example: A Singular Information Matrix
In a hypothetical fit, suppose the information for two parameters is
Its determinant is \(16(9)-12^2=144-144=0\). Its eigenvalues are \(25\) and \(0\), so it is positive semidefinite, not positive definite. The direction \((3,-4)^\mathsf{T}\) has zero curvature because
The information cannot be inverted, so this matrix does not yield finite Hessian-based standard errors for both parameters. In this hypothetical case, the likelihood is locally flat along a parameter combination. A computational routine that reports an inverse after adding a small numerical adjustment would not remove the underlying lack of information; the result would depend on that adjustment.
Worked Example: A Positive-Definite but Ill-Conditioned Matrix
Suppose a second hypothetical fit gives
Its eigenvalues are \(199.99\) in the common-parameter direction and \(0.01\) in the contrast direction. Both are positive, but the condition number is \(199.99/0.01=19999\). The determinant is \(10000-99.99^2=1.9999\), so
Each diagonal entry is approximately \(50.0025\), giving standard errors of about \(\sqrt{50.0025}=7.071\) for each parameter. Although the matrix is technically invertible, the weak contrast direction makes the inversion sensitive to small perturbations. These large standard errors are not an arithmetic error: they reflect very weak local information about the difference between the parameters. Reporting many decimal places would suggest more reliability than this calculation warrants.
Practical Diagnostic Workflow
Identify the exact objective being differentiated and which free parameters are included. Constrained parameters may be represented through transformations, so the Hessian must correspond to the coordinates used for estimation.
Confirm that the reported estimate is a plausible stationary point using gradient checks at the reported estimate. A non-negligible gradient makes a curvature-based maximum interpretation doubtful.
A theoretically symmetric Hessian may be slightly asymmetric numerically. Inspect the asymmetry and eigenvalues; do not silently treat a materially negative eigenvalue of \(J\) as harmless rounding error.
Inspect small eigenvalues, the condition number, and the stability of the inverse under reasonable numerical changes. If the matrix is well behaved, calculate standard errors from the diagonal of \(J^{-1}\) and report parameter units.
A materially negative eigenvalue of observed information means there is a direction of upward log-likelihood curvature, inconsistent with a local maximum in an unconstrained interior parameterization. Possible explanations include a saddle point, an unfinished optimization, numerical error in the Hessian, or a boundary or constraint that changes the relevant geometry. A small negative eigenvalue should be investigated rather than automatically clipped to zero or replaced by its absolute value.
When estimates lie on a boundary, ordinary inverse-Hessian standard errors can fail even if the constrained optimum is legitimate. For example, a variance component constrained to be nonnegative may be estimated as zero. The boundary changes the sampling distribution, and the unconstrained interior approximation need not apply. A transformation such as a logarithm can enforce positivity for parameters strictly above zero, but it cannot make an estimate at the boundary an interior point of the original parameter space.
Alternatives, Limitations, and Common Mistakes
The inverse observed information is a convenient local, likelihood-based uncertainty estimate. A profile-likelihood interval instead examines the likelihood over values of one parameter while optimizing the others; it can reveal asymmetry or a flat region that a quadratic approximation conceals. A sandwich covariance estimate targets a different issue, such as variance estimation under certain forms of model misspecification, and does not repair a singular or poorly identified likelihood. Resampling approaches can assess variability under their own assumptions, but they are not a reason to ignore a pathological Hessian.
The Hessian is also sensitive to how the objective is computed. Finite-difference derivatives, rounding, and numerical approximation can perturb second derivatives, especially when curvature is small. Rescaling parameters may make calculations more stable and aid interpretation, but the corresponding uncertainty must be transformed back to the desired parameter scale. For a smooth transformation \(\phi=g(\theta)\), the local covariance is approximately \(GJ^{-1}G^\mathsf{T}\), where \(G\) is the Jacobian of \(g\) evaluated at \(\hat{\theta}\).
- Mistake: “The optimizer returned standard errors, so the Hessian must be reliable.” A routine may invert an unstable matrix or apply a numerical correction. Check eigenvalues, conditioning, and sensitivity rather than relying on successful output alone.
- Mistake: “Positive diagonal entries prove positive definiteness.” They do not. Off-diagonal entries can create a negative or nearly zero eigenvalue, so assess the full matrix.
- Mistake: “A non-positive eigenvalue always means the scientific model is invalid.” It may instead indicate an unfinished fit, a numerical derivative problem, or boundary geometry. Diagnose the cause before drawing a scientific conclusion.
- Mistake: “A small condition number can be judged without considering units.” Conditioning depends on parameter scaling. Inspect scaled curvature and parameter combinations, while remembering that rescaling does not add data information.
Check Your Understanding
Answer each question, then compare with the solutions below.
- If an interior fitted point has a negative eigenvalue of observed information, what does that imply about local curvature?
- For \(J=\begin{pmatrix}9&0\\0&4\end{pmatrix}\), calculate the Hessian-based standard errors for the two parameters.
- Why can two individually well-curved parameters still have a large standard error for a parameter contrast?
- Does rescaling a parameter eliminate weak identification? Explain.
Solutions. (1) There is a direction with negative information, or equivalently positive log-likelihood curvature, which is inconsistent with an unconstrained interior local maximum. Check the fit, numerical derivatives, and parameter constraints. (2) The inverse is \(\begin{pmatrix}1/9&0\\0&1/4\end{pmatrix}\), so the standard errors are \(\sqrt{1/9}=0.3333\) and \(\sqrt{1/4}=0.5000\), in the respective parameter units. (3) Strong correlation can leave a weakly informed combination, such as a contrast; the full matrix's small eigenvalue and eigenvector reveal that direction. (4) No. Rescaling can improve numerical conditioning and change units, but it cannot add likelihood information. Transform uncertainty back to the intended parameter scale.