- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes a Dual-Frequency Decoupling framework for node classification on homogeneous graphs. The proposed framework consists of three main components: (1) Hierarchical Dual-Frequency Token Encoding (HDTE) separately processes Hop- and Walk-based tokens as local/high-frequency and long-range/low-frequency evidence; (2) Adaptive Hierarchical Global–Local Fusion (AHGF) uses residual gating and adaptively combines the dual-frequency streams; and (3) Multiscale Prior-Interval Constraints (MPIC) imposes metric constraints between the fused representation and the long-range prior while preserving local structural information. Experiments on six homogeneous datasets and three heterogeneous datasets show that the proposed method outperforms the baseline models.
Critical strengths
- Strong empirical performance. The method achieves the best results on all six homogeneous graph datasets, and also performs competitive results on the three heterogeneous datasets.
Critical weaknesses
- The paper suffers from issues in presentation and logical organization. The paper introduces several concepts and components, while the relationships among them are not clearly established.
- Some entries in Table 1 are reported as “unknown values”. This is problematic because Table 1 is the main comparison against existing methods. And it is critical to support the claims. The unusual presentation of the experimental results reduces confidence of the evaluation.
Questions for authors
- The organization and logical flow of the paper need great improvement. For example, the title of the paper stresses that the paper focuses on the Homogeneous Graphs, but the authors state that they focus on homogeneous graph data node classification with extensions to heterogeneous graph data in the Method. Additionally, the paper presents Figure 1 to demonstrate that the task representation capability of graph transformer models declines after ablating the long-range represented expression, but the relationship between the ranges and the task representation capability does not seem to be presented.
- Table 1 is quite strange, e.g., the unknown values and partially provided second-best results. Besides, some results lack the standard deviation.
- The model only works on small datasets, and it should be evaluated on large-scale homogeneous graph datasets.
- The symbols are not inconsistent. For example, is not used in the subsequent process.
- In Section 4.4, the authors state that the experiments show the model ability to capture implicit and explicit topological information. So, what is the difference between implicit and explicit topological information? And how is the experiment shown to capture either implicit topological information or explicit topological information?
- Hyperparameter analysis is missing.
We sincerely thank the Area Chair and the Reviewers for the careful evaluation of our submission and for the constructive feedback. We addressed all the reviewers' concerns carefully, have expanded our evaluation and clarified several implementation details.
In the following, we highlight the main improvements that happened during the rebuttal period: