- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Graft, a lightweight graph adaptation framework. It preserves the temporal priors of the pre-trained TSFM while introducing target-domain relational graph tokens, gated temporal-graph fusion, and a causal-mediated graph adapter to model local, regional, and global dependencies. Experiments show strong performance, good memory efficiency, and cross-task generalization.
Critical strengths
S1: The paper is generally clear and well motivated.
S2: The method is general and is suitable to various TSFMs
Critical weaknesses
W1: The same node-level graph representation is expanded along the output-patch dimension. This may be restrictive, since short-term congestion and long-term trends can involve substantially different dependency graph structures.
W2: The model relies on a fixed target-domain adjacency matrix and does not explicitly model dynamic topology. In traffic systems, dependencies can change with time, incidents, congestion, and other conditions.
W3: The paper represents the entire graph using only the mean of all node tokens, which may discard important spatial heterogeneity.
W4: The paper lacks a formal computational complexity analysis.
W5: The evaluation heavily reply on traffic datasets. Perhaps the paper shall degard to traffic prediction, or use additional domains such as weather, environmental sensing, or energy systems.
W6: Please provide code by platform like anonymous github, as you said in REPRODUCIBILITY STATEMENT.
Questions for authors
Q1: Is there potential functional overlap among the fusion gate, dynamic router, and structural-strength gate?