An Evaluation of Analog-Based Postprocessing Methods across Several Variables and Forecast Models
Bibliographic record
Abstract
Abstract Recently, two analog-based postprocessing methods were demonstrated to reduce the systematic and random errors from Weather Research and Forecasting (WRF) Model predictions of 10-m wind speed over the central United States. To test robustness and generality, and to gain a deeper understanding of postprocessing forecasts with analogs, this paper expands upon that work by applying both analog methods to surface stations evenly distributed across the conterminous United States over a 1-yr period. The Global Forecast System (GFS), North American Mesoscale Forecast System (NAM), and Rapid Update Cycle (RUC) forecasts for screen-height wind, temperature, and humidity are postprocessed with the two analog-based methods and with two time series–based methods—a running mean bias correction and an algorithm inspired by the Kalman filter. Forecasts are evaluated according to a range of metrics, including random and systematic error components; correlation; and by conditioning the error distributions on lead time, location, error magnitude, and day-to-day error variability. Results show that the analog methods are generally more effective than time series–based methods at reducing the random error component, leading to an overall reduction in root-mean-square error. Details among the methods differ and are elucidated upon in this study. The relative levels of random and systematic error in the raw forecasts determine, to a large extent, the effectiveness of each postprocessing method in reducing forecast errors. When the errors are dominated by random errors (e.g., where thunderstorms are common), the analog-based methods far outperform the time series–based methods. When the errors are strictly systematic (i.e., a bias), the analog methods lose their advantage over the time series methods. It is shown that slowly evolving systematic errors rarely dominate, so reducing the random error component is most effective at reducing the error magnitude. The results are shown to be valid for all seasons. The analog methods show similar performance to the operational model output statistics (MOS) while showing greater reduction of random errors at certain lead times.
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.004 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 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.002 | 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".