- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper introduces WaveGSSM, a second-order graph state-space model for propagating spatiotemporal signals. The model explicitly maintains a pattern state and its rate of change, using a graph-wave transition to couple spatial propagation with temporal evolution. Synthetic experiments and modal analysis illustrate the role of motion information in prediction. The authors evaluate the model on four temporal graph node classification benchmarks and ERA5 global weather forecasting. WaveGSSM achieves the highest mean performance on all four benchmarks and reduces geopotential-height RMSE by 20.2% on average over forecast days 1 to 5 relative to a backbone-matched GraphCast-style baseline. Ablation experiments further assess the contribution of motion-state carry.
Critical strengths
- Jointly modeling the pattern and its rate of change provides a reasonable inductive bias for propagating graph signals. The authors clearly motivate this design through synthetic examples and modal analysis that show how the same current pattern can lead to different futures depending on its rate of change.
- The paper is well written, with clear and visually appealing figures. The propagation examples and architecture diagram make the design motivation and state updates easy to follow.
Critical weaknesses
- The baseline comparisons are insufficient. The synthetic experiments mainly compare against GCN-LSTM and GCN-SSM. Although the weather experiments include GraphSSM and GNN-LSTM, comparisons with other relevant architectures that couple space and time remain limited. This makes it difficult to assess the proposed structure’s advantages over existing architectures.
- The methodological advance remains unclear. The fact that identical current patterns can lead to different futures when their rates of change differ is a basic property of second-order dynamical systems and carries limited weight as a standalone contribution. Assessing the novelty requires a clearer account of the substantive differences from existing graph oscillator, graph wave, and graph state-space methods, and the benefits those differences bring.
Questions for authors
- To my knowledge, the spatial stage of a space-then-time architecture can already incorporate temporal dependencies. For example, EvolveGCN uses an RNN to evolve GCN parameters, and GraphSSM mixes information from adjacent snapshots. Although these methods appear in Table 1, the synthetic experiments in Figure 1 mainly compare against GCN-LSTM and GCN-SSM. Include baselines whose spatial encoders incorporate temporal information, or explain their exclusion.
- The weather experiments need comparisons with methods that jointly model space and time. For example, CITRUS, cited in the related work, operates on product graphs and has been evaluated on weather forecasting. Compare it using the same data setup, or explain specifically why it is unsuitable for this task.
- Most baseline results in Table 1 are taken from the GraphSSM paper, while GraphSSM itself is rerun by the authors. State whether the cited results use the same preprocessing, exact node splits, and validation-based model selection. Where these differ, provide results under a common protocol.
- The first contribution and Observation 1 establish that identical patterns can lead to different futures when their rates of change differ. This is a basic property of second-order dynamical systems. Frame it as motivation for the design and avoid presenting the fact itself as a major contribution.
- The benefit of an explicit rate-of-change state over standard temporal memory needs further validation. For example, give GCN-LSTM or GCN-SSM explicit differences between consecutive frames while maintaining comparable parameter budgets. This would help separate the benefits of difference cues from those of the second-order state structure.
- Specify the differences from GraphCON and Graph Wave Networks in terms of state definitions and update equations. Distinguishing “representation propagation” from “motion-state modeling” describes different uses of the dynamics but does not explain why the latter is more advantageous.
- Appendix B.4 states that each weather prediction call reconstructs from two historical frames without directly carrying the states across forecast days. Explain why reconstruction was chosen over continuously updating the latent states, and clarify that motion-state carry occurs only within each processor call.
- The node classification ablation retains the initial , whereas the weather ablation also zeros before the first transition. Add a weather ablation that retains and removes only subsequent state carry. Retrain it under the same conditions to isolate the contribution of state carry.
- Equation (1) assigns learnable weights to support-graph edges, while Appendix C uses disjoint training, validation, and test graphs. Specify how edge weights are generated or transferred to unseen graphs. If the synthetic experiments use a different parameterization, explain how it differs from the main model.
- Report parameter counts for the complete models, including learnable edge weights. Measure inference time for an ERA5 one-day forecast on the same GPU model with a batch size of 1, and state whether it includes grid-to-mesh encoding, mesh processing, and mesh-to-grid decoding.
7 comments
Response to Reviewer 26hT (Part 2/3)
W2 & Q4. The first contribution and Observation 1 establish that identical patterns can lead to different futures when their rates of change differ. This is a basic property of second-order dynamical systems. Frame it as motivation for the design and avoid presenting the fact itself as a major contribution.
A4. We agree with this suggestion. Our intention was to use Observation 1 to motivate the coupled pattern–motion state in WaveGSSM. We have revised the first contribution in Section 1 (page 3) to present it as a basic second-order property that motivates our design.
Q5. The benefit of an explicit rate-of-change state over standard temporal memory needs further validation. For example, give GCN-LSTM or GCN-SSM explicit differences between consecutive frames while maintaining comparable parameter budgets. This would help separate the benefits of difference cues from those of the second-order state structure.
A5. This is a useful control. We added explicit consecutive-frame differences to GCN-LSTM and GCN-SSM on Reddit, with comparable parameter budgets.
| Model | Params | Micro-F1 (%) ↑ |
|---|---|---|
| GCN-LSTM | 2,490,454 | 43.29 ± 0.85 |
| GCN-LSTM + differences | 2,490,454 | 46.75 ± 1.30 |
| GCN-SSM | 2,484,628 | 43.94 ± 1.19 |
| GCN-SSM + differences | 2,484,628 | 46.83 ± 1.14 |
| WaveGSSM w/o carry | 2,486,650 | 45.40 ± 0.59 |
| Our WaveGSSM | 2,486,650 | 47.47 ± 1.68 |
Difference cues clearly help both baselines, and WaveGSSM still has the highest mean. The last two rows separate the two effects. Both start from the same difference-based motion state , and only the full model carries the motion state across steps. Removing this second-order structure lowers Micro-F1 from 47.47 to 45.40, so the gain within WaveGSSM comes from the carried motion state rather than from the difference cue itself. We have added these results to Appendix E.3 (page 25) of the revised manuscript.
W2 & Q6. Specify the differences from GraphCON and Graph Wave Networks in terms of state definitions and update equations. Distinguishing "representation propagation" from "motion-state modeling" describes different uses of the dynamics but does not explain why the latter is more advantageous.
A6. The key difference is what the second-order state represents. In GraphCON [R1] and GWN [R2], it is a layer-wise device for message passing on a static graph. In WaveGSSM, it is the motion of the observed field over time, which the graph directly updates:
GraphCON ( = layer index, static graph):
GWN-sym ( = layer index, static graph, = symmetrically normalized adjacency):
WaveGSSM ( = observed time step):
In GraphCON and GWN, the rate state is the change across layers (, or implicitly ), and the input only sets the initial values. In WaveGSSM, is the rate of change between snapshots, and every snapshot enters through .
This matters for prediction because a forecast depends on how the field is moving at the last snapshot (Eq. 8). Applied to temporal graphs, GraphCON and GWN restart their second-order state at each snapshot and leave motion to a separate temporal module. WaveGSSM instead carries the motion across snapshots and updates it through the graph, so that spatial propagation and temporal evolution advance in one transition and patterns travel along edges over time. In line with this, WaveGSSM achieves higher Micro-F1 than GraphCON+LSTM and GWN-sym+LSTM on all four benchmarks (Table 9 in the revised manuscript, and A1 in our response to Reviewer B7C8). We have added the update equations, state definitions, and this comparison to Appendix E.2 (pages 24–25) of the revised manuscript.
Response to Reviewer 26hT (Part 3/3)
Q7. Appendix B.4 states that each weather prediction call reconstructs from two historical frames without directly carrying the states across forecast days. Explain why reconstruction was chosen over continuously updating the latent states, and clarify that motion-state carry occurs only within each processor call.
A7. Thank you for the careful reading of Appendix B.4. Yes, in weather forecasting, motion-state carry occurs only within each processor call, and we have stated this explicitly in Section 4.1 (page 7) of the revised manuscript.
We rebuild the wave state from the two most recent fields for two reasons. First, no observations are available after initialization, so a latent state carried over ten days could drift from the forecast fields without correction. Rebuilding keeps it anchored to them. Second, every call then has the same form as in training and the same two-frame interface as GraphCast* [R5], so the backbone-matched comparison isolates the processor. Motion information still passes across days, since is rebuilt from the latest two fields.
Q8. The node classification ablation retains the initial , whereas the weather ablation also zeros before the first transition. Add a weather ablation that retains and removes only subsequent state carry. Retrain it under the same conditions to isolate the contribution of state carry.
A8. We are grateful for this suggestion. We have implemented the requested weather ablation, which retains and removes only the subsequent carry. Since full ERA5 training takes a long time, we are retraining it on 16 NVIDIA H100 GPUs, so that we can report the results within the discussion period. We will post them here once training and evaluation are complete. In the meantime, the node-classification ablation follows exactly this design, and removing carry there lowers Micro-F1 and Macro-F1 by 1.81%–3.36% (Table 2).
Q9. Equation (1) assigns learnable weights to support-graph edges, while Appendix C uses disjoint training, validation, and test graphs. Specify how edge weights are generated or transferred to unseen graphs. If the synthetic experiments use a different parameterization, explain how it differs from the main model.
A9. The edge strengths in Eq. (1) are used only in the real-data experiments (node classification and ERA5), where the support graph is fixed, so no transfer is needed. The synthetic diagnostic in Appendix C uses a simplified WaveGSSM that replaces them with each graph's normalized adjacency and shares all parameters across graphs, so it applies directly to unseen graphs. All compared models use the same .
Q10. Report parameter counts for the complete models, including learnable edge weights. Measure inference time for an ERA5 one-day forecast on the same GPU model with a batch size of 1, and state whether it includes grid-to-mesh encoding, mesh processing, and mesh-to-grid decoding.
A10. We are happy to report these numbers. All models were timed on the same NVIDIA H100 GPU with batch size 1, covering grid-to-mesh encoding, mesh processing, and mesh-to-grid decoding. Parameter counts include all learnable edge weights.
| Model | Params (M) | One-day inference (ms) | Day-1 geopotential RMSE (m) ↓ |
|---|---|---|---|
| GraphCast* | 0.720 | 7.93 | 20.58 |
| GNN-LSTM | 0.852 | 15.72 | 20.18 |
| GraphSSM | 1.302 | 14.14 | 27.18 |
| WaveGSSM | 1.820 | 28.73 | 12.71 |
WaveGSSM reduces day-1 RMSE by 38% relative to GraphCast* at under 30 ms per forecast day. Model size does not explain this gain: GraphSSM has more parameters but a higher error, the no-carry ablation with identical parameters is worse (Table 14), and WaveGSSM also performs best in our parameter-matched comparisons on synthetic and Reddit data (A1 and A5 above, and our response to Reviewer 2rMi, Q2). We have added these results to Appendix D.2 (pages 23–24) of the revised manuscript.
We thank the reviewer again for the detailed feedback. We hope these responses address the concerns, and we would be glad to discuss any remaining points.
References
[R1] Rusch et al. Graph-coupled oscillator networks. ICML 2022.
[R2] Yue et al. Graph wave networks. WWW 2025.
[R5] Lam et al. Learning skillful medium-range global weather forecasting. Science 2023.
[R6] Einizade et al. Continuous product graph neural networks. NeurIPS 2024.
[R7] Pareja et al. EvolveGCN: Evolving graph convolutional networks for dynamic graphs. AAAI 2020.
[R8] Li et al. State space models on temporal graphs: A first-principles study. NeurIPS 2024.
Response to Reviewer 26hT (Part 1/3)
We sincerely thank the reviewer for the thorough and detailed review. The questions have helped us clarify several important aspects of the paper. Since the two weaknesses overlap with the questions, we address them together: W1 with Q1–Q2, and W2 with Q4 and Q6.
A1. We appreciate the suggestion to include these baselines. EvolveGCN [R7] and GraphSSM [R8] both pair a GNN with a separate temporal module (an RNN that evolves GCN weights, or an SSM over snapshots), and neither keeps a node-level motion state updated through the graph. Figure 1 uses GCN-LSTM and GCN-SSM as simple space-then-time baselines to illustrate the problem. Following your suggestion, we further added the official EvolveGCN-H and GraphSSM, adapted to the Figure 1 task:
WaveGSSM is best on both metrics, with about 30% lower localization error than GraphSSM. We have added these results to Appendix C (page 20) of the revised manuscript.
A2. Thank you for pointing us to CITRUS [R6]. We adapted CITRUS's product-graph processor to our ERA5 setting, using the same data setup. The results are shown as follows:
Geopotential-height RMSE (m, lower is better), averaged over six pressure levels. WaveGSSM has lower RMSE at all three leads and reduces the mean RMSE over days 1–5 by 34.03%. We have added this comparison to Section 4.3 (page 8) and Appendix F.1 (page 26) of the revised manuscript.
A3. Thank you for pointing this out. The cited numbers follow the GraphSSM benchmark. To address this concern, we reran the baselines under a common protocol as the reviewer suggested (the same preprocessing, the same saved node splits as WaveGSSM, and validation-only model selection). Some examples are shown below (Micro-F1 %):
The reruns are consistent with Table 1, and WaveGSSM remains better than these baselines on all four datasets.