Optimizing Temporal Weighting Functions to Improve Rainfall Prediction Accuracy in Merged Numerical Weather Prediction Models for the Korean Peninsula
Bibliographic record
Abstract
Accurate predictions are crucial for addressing the challenges posed by climate change. Given South Korea’s location within the East Asian summer monsoon domain, characterized by high spatiotemporal variability, enhancing prediction accuracy for regions experiencing heavy rainfall during the summer monsoon is essential. This study aims to derive temporal weighting functions using hybrid surface rainfall radar-observation data as the target, with input from two forecast datasets: the McGill Algorithm for Precipitation Nowcasting by Lagrangian Extrapolation (MAPLE) and the KLAPS Forecast System. The results indicated that the variability in the optimized parameters closely mirrored the variability in the rainfall events, demonstrating a consistent pattern. Comparison with previous blending results, which employed event-type-based weighting functions, showed significant deviation in the average AUC (0.076) and the least deviation (0.029). The optimized temporal weighting function effectively mitigated the limitations associated with varying forecast lead times in individual datasets, with RMSE values of 0.884 for the 1 h lead time of KLFS and 2.295 for the 4–6 h lead time of MAPLE. This blending methodology, incorporating temporal weighting functions, considers the temporal patterns in various forecast datasets, markedly reducing computational cost while addressing the temporal challenges of existing forecast data.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".