Improving the ensemble transform Kalman filter using a second-order Taylor approximation of the nonlinear observation operator
Bibliographic record
Abstract
Abstract. The Ensemble Transform Kalman Filter (ETKF) assimilation scheme has recently seen rapid development and wide application. As a specific implementation of the Ensemble Kalman Filter (EnKF), the ETKF is computationally more efficient than the conventional EnKF. However, the current implementation of the ETKF still has some limitations when the observation operator is strongly nonlinear. One problem is that the nonlinear operator and its tangent-linear operator are iteratively calculated in the minimization of a nonlinear objective function similar to 4DVAR, which may be computationally expensive. Another problem is that it uses the tangent-linear approximation of the observation operator to estimate the multiplicative inflation factor of the forecast errors, which may not be sufficiently accurate. This study seeks a way to avoid these problems. First, we apply the second-order Taylor approximation of the nonlinear observation operator to avoid iteratively calculating the operator and its tangent-linear operator. The related computational cost is also discussed. Second, we propose a scheme to estimate the inflation factor when the observation operator is strongly nonlinear. Experimentation with the Lorenz-96 model shows that using the second-order Taylor approximation of the nonlinear observation operator leads to a reduction of the analysis error compared with the traditional linear approximation. Similarly, the proposed inflation scheme leads to a reduction of the analysis error compared with the procedure using the traditional inflation scheme.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".