- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper sees that current relational graph learning frameworks cannot perform message passing across distance multi-hop neighbors, fail to preserve the structural and semantic relevance when conducting graph sampling, and may impose an inaccurate temporal focus that mislead the attention toward irrelevant information. The Gaussian Relational Graph Transformer (GelGT) is a method proposed to solve all these challenges exhibit in the relational graph learning problem. GelGT proposes BFS-based structural integrity sampling and semantic refinement to identify and preserve valuable nodes for subgraph construction. To inject temporal information, a Gaussian temporal bias-based attention module is subsequently introduced. The GNN is coordinated with the temporal bias-based attention module for cell value prediction. Extensive experiments are conducted across 7 datasets and the baseline comparison indicates the consistent performance superiority of GelGT. Thorough ablation studies, hyperparameter analysis, overall framework efficiency analysis and other additional analyses have been provided.
Critical strengths
-
Gaussian temporal bias-based attention is a simple yet effective trick in boosting the prediction accuracy.
-
Extensive experiments conducted. The amount of work dedicated is truly appreciated.
-
The framework overview provides a good visualization of the proposed components, thus helps readers to understand it.
Critical weaknesses
-
Figure 4 has the x-axis denoted as “Sampling Size” but in Section 3, and are independently defined. This causes confusion about what sampling size means in this figure.
-
Table 8c shows the performance comparison of different temporal bias terms. However, it is noticed that for each task, the performance difference between the three temporal bias terms is marginal. This then leads to question about what makes Gaussian temporal bias the preferable design (parameter counts, computational overhead, or inference latency?). Is there empirical evidence to support the claim?
-
Despite concise implementation details provided in Appendix B, no code repo or pseudocode algorithm provided. It would be preferred to have a complete code workflow for reproducibility.
Questions for authors
Please address 1 and 2 in Weaknesses.