Error covariance estimation methods based on analysis residuals: theoretical foundation and convergence properties derived from simplified observation networks
Bibliographic record
Abstract
We examine the theoretical foundation of the method to estimate error covariances based on analysis residuals in observation space, also known as the Desroziers method. Our analysis also includes a method based on a posteriori diagnostics of variational analysis schemes. A mathematical analysis of convergence is carried out with a simplified regular observation network, where we identify stable and unstable fixed‐point solutions, examine their rate of convergence and the conditions for convergence to the truth and compare it with maximum‐likelihood estimation. It is shown that the estimation of variance parameters converges to the truth if the error correlation is specified correctly. The convergence is much faster with the analysis increment method than with the method designed for variational analysis schemes. We also propose a combination of the Desroziers scheme and the maximum‐likelihood estimation method that could be used to estimate the spatial correlation length‐scale of observation errors. The estimation of both full observation and background‐error covariances matrices derived entirely from observation‐based residuals does not change the gain matrix, but the estimation of either one matrices is well‐defined. An analysis of the estimation of the full observation error covariance matrix using a regular observation network reveals that if all eigenvalues of the prescribed background‐error covariance are smaller than their corresponding innovation covariance eigenvalue, then the estimated error covariance converges to the truth but only if the prescribed background error is correctly specified. In the case where some eigenvalues of the background‐error covariance greatly exceed those of the innovation covariance, the convergent observation‐error matrix may become rank‐deficient. Its inverse does not exist.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".