- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes GHMN, a framework the combines a hierarchical spherical mesh backbone with a flow-matching generative head for global station weather forecasting. Experiments on the NOAA GSOD dataset across six meteorological variables show consistent improvements over GNN-based, Transformer-based, and diffusion-based baselines in both deterministic and probabilistic settings.
Critical strengths
1.The paper addresses two real pain points in global station weather forecasting: partitioning-based methods suffer from unbalanced splits and boundary information loss, and jointly learning spatiotemporal patterns and uncertainty is data-hungry when stations are sparse and unevenly distributed. 2.The bidirectional propagation with independent parameters per level clearly differs from standard multi-scale GNNs that share one layer across scales, and the single-scale ablations confirm the benefit. 3.GHMN outperforms all baselines across variables and metrics, with particularly clear gains on extreme-event identification and probabilistic forecasting.
Critical weaknesses
1.The flow-matching head is essentially a standard conditional MLP with AdaLN conditioning and an velocity loss, closely following existing work. Its novelty lies mainly in where it is applied (on deterministic predictions rather than latent features), not in the method itself. The paper should state more clearly what is genuinely new here versus a straightforward engineering choice. 2.Table 2 only reports CSDI, DiffSTG, and GHMN, and the CRPS numbers for the diffusion baselines are difficult to assess without the deterministic baselines' CRPS for reference. More broadly, standard probabilistic baselines (e.g., quantile regression or a Gaussian head on the same backbone) are missing, so it is unclear how much of the gain comes from flow matching specifically. 3.The paper evaluates only on GSOD (daily), while WEATHER-5K is merely cited as a reference, not used as a benchmark. Since hourly data is more relevant for many operational tasks, adding WEATHER-5K as an extra evaluation setting would better demonstrate the model's generality
Questions for authors
-
What is genuinely new in the generative formulation? The flow-matching head closely follows existing work (a standard conditional MLP with AdaLN conditioning and an velocity loss), with novelty mainly in where it is applied rather than in the method itself. Could the authors clarify what is genuinely new here versus a straightforward engineering choice?
-
How much of the probabilistic gain comes from flow matching specifically? Table 2 only reports CSDI, DiffSTG, and GHMN, and the CRPS numbers are hard to assess without the deterministic baselines' CRPS for reference. Standard probabilistic baselines (e.g., quantile regression or a Gaussian head on the same backbone) are also missing. Can the authors add such baselines to isolate the contribution of flow matching?
-
Can the model generalize to an additional dataset? The paper evaluates only on GSOD (daily), with WEATHER-5K merely cited as a reference. Since hourly data is more relevant for many operational tasks, could the authors add WEATHER-5K as an extra evaluation setting to better demonstrate generality?
-
What is the inference cost of GHMN versus baselines? For the probabilistic setting with 10 samples × 50 steps in particular, reporting latency, FLOPs, and memory would make the efficiency claim more convincing.
2 comments
Considering the novelty of the work, I maintain my original score.
Q1: What is genuinely new in the generative formulation?
We agree that MLP, AdaLN, and flow matching are established components. Our contribution is a decoupled formulation for sparse, irregular station data: the hierarchical backbone learns multi-scale spatiotemporal dynamics, and the generative head estimates uncertainty conditioned on explicitly supervised deterministic forecasts rather than latent features. Jointly trained, this design reduces the complexity of learning dynamics and uncertainty together under limited data.
Q2: How much of the probabilistic gain comes from flow matching specifically? Standard probabilistic baselines (e.g., quantile regression or a Gaussian head on the same backbone) are also missing.
Deterministic baselines provide point forecasts rather than predictive distributions. If treated as point-mass distributions, their CRPS reduces to absolute error; thus, Table 1's MAE provides the corresponding deterministic CRPS reference. To isolate the probabilistic contribution of flow matching, we conduct controlled head ablations using the same GHMN backbone, identical head architectures, and a matched inference budget of 50 steps.
FM improves both point metrics and CRPS under the matched budget. We also evaluate a Gaussian residual baseline with a fixed isotropic variance estimated from the same backbone's training residuals, reporting interval coverage and Sample Spread Ratio (SSR):
Experimental Analysis:
Q3: Can the model generalize to an additional dataset?
We have additionally evaluated GHMN on MADIS 2020, an independent dataset with hourly observations and a substantially denser station network. Following the dataset's quality-control protocol, we use 25,328 stations in a 2-hour-to-2-hour forecasting task. As shown in the table, GHMN consistently outperforms MIGN across all variables.
Q4: Reporting latency, FLOPs, and memory would make the efficiency claim more convincing.
Our hierarchical mesh has a fixed number of levels and nodes, so increasing the station count primarily scales the GNN encoder/decoder. With 10 samples and 50 integration steps, the backbone is evaluated once to obtain a deterministic condition reused throughout ensemble generation. The 500 subsequent evaluations involve only the MLP head, avoiding repeated hierarchical mesh computation. The profiling results below use a training batch size of 16 and an inference batch size of 1 with 10 prediction samples. Nearly tripling the station count yields sub-linear increases in time and memory, demonstrating practical scalability.