- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies multi-step spatio-temporal forecasting when nodes may arrive or disappear and graph topology changes across stages, and proposes DyCSTA. The method uses a dynamic node-evolution module to exploit historical information from persistent nodes while handling newly arriving nodes from their current observations. It then performs temporal and spatial modeling on the current graph, decomposes representations into forecast-relevant and contextual components, and conditions prediction on latent environment prototypes with a context-replacement training objective. Experiments span traffic, communication, air-quality, and energy datasets, with analyses on overall forecasting, new-node prediction, forecast horizons, component ablations, and representation separation. The strongest gains are reported on the two flow datasets, while performance remains competitive in the other domains.
Critical strengths
S1. The paper goes beyond standard forecasting under a fixed node set by jointly considering node arrivals, departures, and connectivity changes. Deciding what historical information should be retained for persistent nodes, how to forecast newly arriving nodes with limited history, and how to rebuild dependencies after topology changes are practically relevant problems in evolving infrastructures.
S2. The experiments go beyond aggregate MAE/RMSE/MAPE and include analyses of existing versus newly arriving nodes, different forecast horizons, and forecast-relevant versus contextual representations. In particular, the new-node and long-horizon analyses directly relate to the paper’s motivation of topology evolution and limited-history forecasting.
Critical weaknesses
W1. The paper states that persistent-node stability is measured using Wasserstein distance between empirical distributions from adjacent stages, with stable nodes prioritized for the evolution pool and high-activity new nodes filling the remaining slots. However, the released ENERGY-Wind code directly sets all current nodes as top_nodes and keep_nodes, without the described Wasserstein-based ranking or activity-based selection. This makes it unclear whether the central dynamic-evolution mechanism was actually used to obtain the reported results, directly affecting soundness, reproducibility, and claim-evidence consistency.
W2. The paper motivates evolving-graph forecasting partly by arguing that frequent retraining may be impractical, but reports no comparison of training time, inference latency, peak memory, parameter count, or scaling behavior. Since DyCSTA combines GRU-based evolution, temporal attention, graph propagation, and latent-context inference, its computational overhead is not obviously negligible. This weakens the practical deployment motivation.
Questions for authors
Q1. Were the Table 1 results actually obtained using the Wasserstein-based stability selection described in the paper? If so, could the authors explain why this mechanism is absent from the released ENERGY-Wind implementation and provide the corresponding implementation? If not, please clarify which experiments used a simplified evolution mechanism.
Q2. Could the authors provide efficiency comparisons with the main dynamic/continual baselines, including some combination of training time, inference latency, peak GPU memory, and parameter count, together with at least one scaling analysis over graph size?
Q3. How should the term “causality-inspired” be interpreted in this work? The current matched-probe analysis mainly shows that and have different predictive utility, but does not establish that they correspond to causal versus contextual factors.
4 comments
Re
Thank you for the clarification and the updated code. Could you provide a quantitative comparison of the Energy-Stream results obtained using the original full-node-pooling implementation and the corrected Wasserstein-based selection? This would help clarify whether the implementation difference affects the reported results.
Thank you for the reviewer’s comments.
To provide a quantitative comparison, we have implemented the following experiment, where Energy‑Stream results were obtained by employing the full‑node‑pooling implementation and the Wasserstein‑selection protocol, respectively.
| Pooling implementation | Metric | H3 | H6 | H12 | Avg. | Mean training / epoch (s) | Mean inference / epoch (s) |
|---|---|---|---|---|---|---|---|
| Original full‑node pooling | MAE | 0.96 | 1.31 | 2.15 | 1.44 | 104.81 | 7.59 |
| RMSE | 1.33 | 1.76 | 2.73 | 1.89 | |||
| MAPE (%) | 9.65 | 14.13 | 27.04 | 17.04 | |||
| Wasserstein selection | MAE | 0.92 | 1.18 | 1.79 | 1.26 | 102.66 | 7.18 |
| RMSE | 1.31 | 1.67 | 2.41 | 1.76 | |||
| MAPE (%) | 10.89 | 13.23 | 17.41 | 13.51 |
The Wasserstein selection gives lower MAE and RMSE at all reported horizons and lower average MAPE, with the largest gains at the 12‑step horizon. It also has the shorter recorded mean training and inference times. The original full‑node implementation has a slightly lower MAPE at H3, while the Wasserstein‑selection protocol is better for the longer horizons and the average score.
Re
Thanks for your rebuttal. My questions have been addressed, and I’ll raise my score.
Responses to Question 1: We apologize for the confusion caused by our accidental release of the full‑node‑pooling version in the shared files. And, the corrected code version has been uploaded. For the main experiments on PEMS‑Stream, Air‑Stream and Energy‑Stream, we adopt Wasserstein‑based stable node selection. For JiNan, since the number of active nodes is small, all active nodes at each stage are used. We have complemented the above remarks in Section 5.2 of the revised manuscript.
Responses to Question 2: According to this comment, we evaluated the prediction performance and resource overhead of the six approaches on PEMS. DyCSTA handles changes in node sets and connectivity through forward state evolution and current‑graph encoding, without additional gradient‑based retraining.. (Detailed experimental settings and discussions are provided in Table 8, Appendix A.10)
We further conduct experiments on EAC and STBP after amortizing stage‑wise costs, and the results are shown in Table 9, Appendix A.10.
In order to implement scaling analysis, we have further complemented the following experiment (part of the table is shown below; the full version and related discussion are provided in Table 10, Appendix A.11). Throughout the experiments, the Batch=1 latency of DyCSTA remains approximately 16 ms, indicating that the single‑window inference latency stays stable as nodes and edges grow stage by stage.
Responses to Question 3: Thank you for the reviewer’s comments. First, we agree that the matched‑probe analysis does not establish that C and T recover causal and contextual factors of the underlying data‑generating process. Actually, we initially planned to follow our prior line of reasoning from our prior work and build the model based on SCM causal learning. However, preliminary experiments yielded unsatisfactory results. We therefore retain the valuable idea of decomposing target‑related predictive information from disturbance caused by environmental changes, and adopt an alternative technical route to realize this idea under the setting of dynamically changing nodes. Correspondingly, we revise “Causality” in the title to “Causality‑Inspired”, to indicate that this work is inspired by causal thinking rather than adopting rigorous causal modeling methods. We recognize that several statements in the manuscript still overemphasize causal properties and may lead to misunderstanding. We have carefully examined the entire paper and rephrased potentially misleading descriptions.