- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates multivariate time-series forecasting in settings where future actions and exogenous inputs are known. In conventional time-series models, intermediate mechanisms through which such drivers affect the targets are often left implicit within the predictor. Alternatively, these intermediate mechanisms can be represented as a graph and modeled using a GNN, but such approaches do not explicitly capture how the effect of an action accumulates and decays over time. To address this issue, the paper proposes a method that represents driver effects as mechanism-specific latent states, rolls these states forward into the future, and propagates them through a graph to individual target variables. A key component is a graph structure specified in advance as a domain-informed prior. The method also introduces Future Rollout, which sequentially updates the latent states using known future drivers. Experiments on four different systems show that the proposed method achieves the best or near-best forecasting accuracy overall. The paper further conducts extensive ablation studies to analyze which of its many design choices are important. In particular, the result that relatively strong performance can still be obtained by retraining with a shuffled graph is noteworthy.
Critical strengths
One critical strength is that the paper proposes a novel approach to multivariate time-series forecasting that primarily leverages a graph structure specified in advance as a domain-informed prior, while also introducing Future Rollout to sequentially update latent states using known future drivers.
Another strength is the extensive ablation study. The proposed framework incorporates many design choices, and the authors make a substantial effort to disentangle their effects through a large number of ablation experiments.
Critical weaknesses
The paper introduces too many components, and the relationships among the problem formulation, the underlying hypotheses, and the individual technical components are not sufficiently organized. As a result, it is difficult to assess the necessity of each component and to identify the central technical contribution. Although the paper includes an extensive set of ablation studies, they do not sufficiently disentangle the main hypothesis of the proposed method from the contributions of its individual components, making it difficult to evaluate the novelty and technical significance of the overall framework.
In particular, while the sparse typed routing structure itself may be beneficial, the importance of the domain-informed semantic graph is not convincingly demonstrated. The shuffled-slot retraining achieves performance close to that of the domain graph, which suggests that the effectiveness of the domain graph, presumably one of the central technical contributions of the method, has not been sufficiently established.
Questions for authors
Could you revise the paper to more clearly disentangle the central hypothesis of the proposed method from the contributions of its individual components, so that readers can easily understand why each component is necessary and what constitutes the core contribution of the work?
2 comments
Response to Reviewer c1cV (Part 2)
Question for Authors: Could you revise the paper to more clearly disentangle the central hypothesis from the contributions of individual components, so readers understand why each component is needed and what constitutes the core contribution?
Response: We appreciate this suggestion. The central hypothesis motivates two main technical components: (1) typed latent-effect dynamics with future rollout (Section 4.1), which models how driver-mediated effects evolve across the forecast horizon, and (2) graph-first residual routing (Section 4.2), which uses that structured trajectory as the predictive base while treating direct driver information as a capacity-controlled correction. The domain-informed graph supplies the relational prior for this pathway, rather than constituting a separate claim that each semantic assignment is necessary.
The manuscript already separates these components in Sections 4.1–4.2 and examines their roles through the matched ablations in Sections 5.1–5.3. To make their relationship to the central hypothesis more explicit, we have revised the Introduction (Lines 47–49) to state the central hypothesis directly, the opening of Section 4 (Lines 160–161) to clarify the complementary roles of latent-effect dynamics and graph-first residual routing, and Section 5.1 (Lines 308–312) to explicitly connect the ablation ladder to latent-effect persistence and future rollout.
Response to Reviewer c1cV (Part 1)
We sincerely thank the reviewer for the thoughtful evaluation and constructive feedback. We especially appreciate the recognition of the novelty of combining a domain-informed typed relational prior with future latent-state rollout, as well as the extensive ablation study. We address the concerns below and clarify the central hypothesis and the roles of individual components in the revised manuscript (Introduction, Lines 47–49; Section 4, Lines 160–161).
Weakness 1: The framework contains many components, making it difficult to distinguish the central hypothesis from individual design choices and assess their necessity.
Response: Thank you for highlighting this issue. We would like to clarify that the central contribution is structured latent-effect world modeling with future rollout, rather than the collection of components or the exact semantic graph assignment in isolation. Our core hypothesis is that future drivers should update typed, persistent latent-effect states, which are explicitly rolled forward across the forecast horizon and used to predict multiple targets, instead of entering only as direct predictor covariates. The graph provides a structured driver–effect–target interface for this process, while graph-first residual routing (GR) makes the rolled representation the predictive base and confines direct driver information to a complementary residual path.
Our existing matched comparisons test distinct aspects of this hypothesis:
Together, these results support a progression from persistent latent effects → future rollout → structured predictive-base routing. The typed graph and residual mechanism serve distinct roles within this framework, with dataset-dependent contributions.
Weakness 2: The importance of the domain-informed semantic graph is not convincingly demonstrated, because shuffled-slot retraining performs close to the domain graph.
Response: Thank you for raising this concern. The domain graph achieves the lowest mean nMAE on both Greenhouse (0.1285 vs. 0.1309) and Wastewater (0.1245 vs. 0.1254) compared with shuffled-slot retraining (Table 4), although the differences are modest. The competitive shuffled-slot results suggest that the model can adapt its learned representations to an alternative routing assignment during retraining. Thus, we do not claim that one precise semantic assignment is indispensable.
Inference-time graph swapping offers complementary evidence: changing the routing assignment without retraining increases forecasting error in both directions (e.g., Wastewater nMAE rises from 0.1245 to 0.1610 when the domain-trained model uses the shuffled assignment). This indicates that the learned representations depend on the routing assignment used in training, rather than demonstrating that the domain semantics are uniquely correct. The learned fully connected graph also performs worse than the domain graph, particularly on Greenhouse (0.1357 vs. 0.1285), supporting the utility of the sparse typed prior relative to that alternative.
Our central contribution is structured latent-effect world modeling with future rollout, not the necessity of an exact domain-informed graph. The domain graph provides a relational inductive bias, while the gains from explicit graph routing and specific assignments vary by dataset (Tables 2 and 4).