- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies how prediction errors accumulate in Graph World Models, which autoregressively roll out graph-structured states for planning. The authors analyze both fixed-edge and dynamic-edge regimes. For FE they derive a Graph Error Amplification Factor that cleanly separates topology effects from model effects, and for DE they derive a joint 2x2 node-edge error operator whose spectral radius governs coupled error growth. They also bound planning regret, showing it can grow super-linearly with horizon when the operator is expansive. Experiments on seven synthetic topologies and two agent-graph testbeds validate the theory, and they propose Error-Aware GWM with spectral regularization, rollout consistency, and critical-node weighting, which prevents divergence in vanilla GCN rollouts.
Critical strengths
1.The theory is clean and genuinely useful. The GEAF decomposition and the joint node-edge operator give an intuitive, testable account of why some graphs blow up under rollout, and the planning-regret connection makes it more than a toy analysis.
2.The empirical validation is systematic. Seven topologies spanning a wide spectral range, FE and DE regimes, perturbation and rewiring studies, plus heterogeneous agent testbeds, and the findings consistently support the predictions.
Critical weaknesses
1.The theoretical contribution is a fairly standard application of Lipschitz contraction arguments to graphs, so the bounds themselves are not very surprising to anyone familiar with model-based RL error analysis.
2.The proposed Error-Aware GWM is mostly a repackaging of known tricks. Spectral norm regularization, multi-step rollout training, and degree-based node weighting all exist in prior work, so the method's novelty is limited.
3.Several results are descriptive rather than confirmatory. GrowthSlope correlations look noisy, some tables have missing or inconsistent entries, and the real-world benchmarks show mixed results with DE-GWM sometimes worse than FE.
Questions for authors
Please see the Weaknesses.
6 comments
As the rebuttal period ends tomorrow, please let us know if you have any remaining concerns. We would be grateful if you could revisit your assessment in light of our rebuttal and additional experiments. Thank you again for your review and consideration!
The rebuttal helped clarify the role of the node–edge decomposition and the reporting discrepancies. My concerns about the novelty of the training method and the strength of the empirical evidence remain, so I maintain my rating.
rebuttal to Reviewer c79w
1. Weakness 1 and Questions: Novelty of the theory
Appendix A acknowledges the existing foundations, including Asadi et al. [1] and Janner et al. [2]. Our contribution is a graph-specific error analysis. Section 3.3, Eqs. (3.5)–(3.8), separates node-to-node, edge-to-node, node-to-edge, and edge-to-edge sensitivities. This reveals how node–edge feedback affects error growth in DE rollouts, a pathway absent in FE prediction. Section 3.4 further connects the joint error bound to planning regret.
A scalar bound can describe the joint state but cannot directly explain how each pathway affects error growth. Our decomposition identifies these effects, explains the difference between FE and DE rollouts, and guides targeted feedback experiments. The contribution is therefore a graph-specific analysis of error propagation, not a new general contraction inequality.
2. Weakness 2 and Questions: Novelty of Error-Aware GWM
Section 4 acknowledges the existing components. Our contribution is to connect them directly to the graph error analysis. Each component targets a different source of long-term error: transition sensitivity, error from autoregressive inputs, and structurally weighted node error. Rather than simply combining existing losses, Error-Aware GWM uses the theoretical analysis to guide a unified training objective for stable and accurate rollouts.
Paper Table 1 reports median NodeMSE@32 of 0.364 for spectral projection and 2.67×10−4 for Error-Aware GWM. Rebuttal Table E2 (Reviewer zDcH, Response 2) confirms this comparison with corrected divergence counts. Rebuttal Table R1 (Reviewer F71V, Response 2) isolates the effect of each objective on the original backbone, while Rebuttal Table R4 (Reviewer zDcH, Response 5) shows that the benefits extend to MPNN. Together, these results support both the training design and its effectiveness beyond the original model.
3. Weakness 3 and Questions: Exploratory results, table inconsistencies, and mixed benchmarks
Appendix B.3 clearly labels GrowthSlope as exploratory, while Appendix D.3.3 reports OOD tests that do not remain significant after correction. Paper Tables 4–6 also retain mixed results on agent and real-world benchmarks. We will make these limits clear in the main text: a pooled correlation does not prove a general law of error growth, and our method does not outperform all baselines across all tasks.
We checked the inconsistent summaries against saved records and identified the errors. Rebuttal Table E2 corrects the two divergence counts. In Paper Table 2, the mean spectral excess ρ(B)−max(LX,MA) across all 108 DE runs is approximately 77.0, rather than 155. Agent records contain 50 test instances per testbed–seed cell, not 160 per testbed. We will correct these values and denominators. The reported accuracy medians and paired DE-training improvements remain unchanged.
We will also explain every missing result, including the MPNN out-of-memory failures reported in Appendix D.2.1. We will report attempted, completed, and divergent runs, paired-ratio calculations, and how non-finite errors are handled. Any analysis based only on successful runs will clearly state which runs were included.
Our code is public. We will release the full run manifest, raw metrics, failure records, splits, seeds, and aggregation scripts. We retain all unfavorable comparisons and report every planned experimental setting without selecting favorable seeds or datasets. The mixed results also clarify the scope of our method: Error-Aware GWM mainly targets long-term rollout stability, not universal improvements across all tasks.
[1] Kavosh Asadi, Dipendra Misra, and Michael L. Littman. Lipschitz Continuity in Model-based Reinforcement Learning. ICML, 2018.
[2] Michael Janner, Justin Fu, Marvin Zhang, and Sergey Levine. When to Trust Your Model: Model-Based Policy Optimization. NeurIPS, 2019.