SearcharxivSearch

arXiv · 2602.15830

Ensemble-size-dependence of deep-learning post-processing methods that minimize an (un)fair score: motivating examples and a proof-of-concept solution

Abstract

Fair scores reward ensemble forecast members that behave like samples from the same distribution as the verifying observations. They are therefore an attractive choice as loss functions to train data-driven ensemble forecasts or post-processing methods when large training ensembles are either unavailable or computationally prohibitive. The adjusted continuous ranked probability score (aCRPS) is fair and unbiased with respect to ensemble size, provided forecast members are exchangeable and interpretable as conditionally independent draws from an underlying predictive distribution. However, distribution-aware post-processing methods that introduce structural dependency between members can violate this assumption, rendering aCRPS unfair. We demonstrate this effect using two approaches designed to minimize the expected aCRPS of a finite ensemble: (1) a linear member-by-member calibration, which couples members through a common dependency on the sample ensemble mean, and (2) a deep-learning method, which couples members via transformer self-attention across the ensemble dimension. In both cases, the results are sensitive to ensemble size and apparent gains in aCRPS can correspond to systematic unreliability characterized by over-dispersion. We introduce trajectory transformers as a proof-of-concept that ensemble-size independence can be achieved. This approach is an adaptation of the Post-processing Ensembles with Transformers (PoET) framework and applies self-attention over lead time while preserving the conditional independence required by aCRPS. When applied to weekly mean $T_{2m}$ forecasts from the ECMWF subseasonal forecasting system, this approach successfully reduces systematic model biases whilst also improving or maintaining forecast reliability regardless of the ensemble size used in training (3 vs 9 members) or real-time forecasts (9 vs 100 members).

Explore related subjects

Keep this discovery

BibTeXRIS

Christopher David Roberts. 2026-02-17. Ensemble-size-dependence of deep-learning post-processing methods that minimize an (un)fair score: motivating examples and a proof-of-concept solution. https://arxiv.org/abs/2602.15830

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Windowed Envelope Statistics for Time-Domain Significant Wave Height Estimation From HF Radar

Significant wave height (SWH) retrieval from high-frequency (HF) radar typically relies on a weak second-order Doppler continuum that is sensitive to noise, interference, and spectral leakage. This letter presents a Windowed Envelope Statistics Estimator (WESE) that operates directly on beam-formed time-domain voltages. A second-order term obtained from a Neumann expansion of the rough-surface field equation motivates quadratic compensation of localized radar features. WESE extracts the mean, standard deviation, or variance from overlapping windows of the in-phase, quadrature, or envelope-magnitude sequence, followed by quadratic compensation, rank ordering, least-squares regression, and causal smoothing. Evaluation used 335 synchronized hourly observations from a 13.385 MHz, 12-element WERA system at Argentia, Newfoundland and Labrador. The optimal configuration used quadrature variance, a 16-sample window, 896 retained chronological samples, and 30-h smoothing, achieving an RMSE of 0.152 m and a Pearson correlation of 0.978. This represents RMSE reductions of 32.1% and 18.7% relative to previously reported linear and second-order compensated ordered-statistics models, respectively. The results demonstrate robust time-domain SWH estimation without explicit Doppler-spectrum construction.

physics.ao-ph

KiloDA: Reconstructing kilometer-scale near-surface wind states from sparse station observations

Accurate kilometer-scale near-surface winds are important for understanding atmospheric processes over complex terrain, yet remain difficult to reconstruct from sparse and unevenly distributed observations. Here we introduce KiloDA, a diffusion framework for hourly kilometer-scale wind reconstruction from surface stations. KiloDA learns the statistical distribution and spatial structure of wind fields from historical 3-km Weather Research and Forecasting (WRF) model forecasts. At each reconstruction time, no contemporaneous WRF field is used. Instead, station observations provide the only constraints on the current atmospheric state and guide posterior sampling from the learned prior. In idealized WRF experiments, KiloDA recovers localized wind structures when only 0.24% of grid cells are observed and shows an overall advantage over conventional interpolation across terrain conditions and wind speed regimes. This capability largely transfers to real observations. In a fully withheld region, KiloDA reduces the median wind speed root mean square error (RMSE) by 19% relative to ERA5 reanalysis, using only observations outside the region, with the largest improvements over high-elevation and high-relief terrain. A random station holdout further confirms that this advantage extends across different complex-terrain locations and holdout configurations. These results show that historical model archives can provide useful structural knowledge for reconstructing kilometer-scale wind fields from sparse observations without requiring an accurate model estimate of the current atmospheric state.

physics.ao-ph