Kalman Filter and Analog Schemes to Postprocess Numerical Weather Predictions
Bibliographic record
Abstract
Abstract Two new postprocessing methods are proposed to reduce numerical weather prediction’s systematic and random errors. The first method consists of running a postprocessing algorithm inspired by the Kalman filter (KF) through an ordered set of analog forecasts rather than a sequence of forecasts in time (ANKF). The analog of a forecast for a given location and time is defined as a past prediction that matches selected features of the current forecast. The second method is the weighted average of the observations that verified when the 10 best analogs were valid (AN). ANKF and AN are tested for 10-m wind speed predictions from the Weather Research and Forecasting (WRF) model, with observations from 400 surface stations over the western United States for a 6-month period. Both AN and ANKF predict drastic changes in forecast error (e.g., associated with rapid weather regime changes), a feature lacking in KF and a 7-day running-mean correction (7-Day). The AN almost eliminates the bias of the raw prediction (Raw), while ANKF drastically reduces it with values slightly worse than KF. Both analog-based methods are also able to reduce random errors, therefore improving the predictive skill of Raw. The AN is consistently the best, with average improvements of 10%, 20%, 25%, and 35% with respect to ANKF, KF, 7-Day, and Raw, as measured by centered root-mean-square error, and of 5%, 20%, 25%, and 40%, as measured by rank correlation. Moreover, being a prediction based solely on observations, AN results in an efficient downscaling procedure that eliminates representativeness discrepancies between observations and predictions.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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".