- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper investigates the roles of relational information as training-time supervision and inference-time message passing. Through same-checkpoint comparisons on financial time-series data, the authors find that graph propagation generally degrades representation quality in future-state retrieval tasks.
Critical strengths
The paper addresses a meaningful question about the distinct roles of relational information in representation learning. The same-checkpoint comparison provides a controlled way to evaluate inference-time graph propagation, and the experiments offer useful empirical insights into its potential limitations.
Critical weaknesses
1.The central research question is not inherently tied to time-series learning, yet the experiments are limited to a single financial time-series dataset. This makes it difficult to disentangle the effects.
2.The findings may depend on the specific graph construction and model architectures, while the existing ablations are insufficient to establish their generality.
3.Although the authors acknowledge this limitation, the lack of a shuffled-graph control makes it difficult to determine whether the observed improvements are driven by meaningful relational information or merely by the regularization effect.
Questions for authors
1.Could the authors evaluate the proposed diagnostic on non-temporal graph datasets to better isolate the effects of graph propagation?
2.Do the conclusions generalize to other datasets and tasks?
3.How sensitive are the findings to different graph constructions and model architectures?
4.Could the authors include a shuffled-graph control?