Reduced-Rank Sigma-Point Kalman Filter and Its Application in ENSO Model
Bibliographic record
Abstract
Abstract The huge computational expense has been a main challenge while applying the sigma-point unscented Kalman filter (SPUKF) to a high-dimensional system. This study focuses on this issue and presents two methods to construct a reduced-rank sigma-point unscented Kalman filter (RRSPUKF). Both techniques employ the truncated singular value decomposition (TSVD) to factorize the covariance matrix and reduce its rank through truncation. The reduced-rank square root matrix is used to select the most important sigma points that can retain the main statistical features of the original sigma points. In the first technique, TSVD is applied on the covariance matrix constructed in the data space [RRSPUKF(D)], whereas in the second technique TSVD is applied on the covariance matrix constructed in the ensemble space [RRSPUKF(E)]. The two methods are applied to a realistic El Niño–Southern Oscillation (ENSO) prediction model [Lamont-Doherty Earth Observatory model, version 5 (LDEO5)] to assimilate the sea surface temperature (SST) anomalies. The results show that both the methods are more computationally efficient than the full-rank SPUKF, in spite of losing some estimation accuracy. When the truncation reaches a trade-off between cost expense and estimation accuracy, both methods are able to analyze the phase and intensity of all major ENSO events from 1971 to 2001 with comparable estimation accuracy. Furthermore, the RRSPUKF is compared against ensemble square root filter (EnSRF), showing that the overall analysis skill of RRSPUKF and EnSRF are comparable to each other, but the former is more robust than the latter.
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.000 | 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.000 | 0.000 |
| 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".