- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper aims to preserve task-relevant structures while reducing structural redundancy. It propose an information-theoretic formulation that uses random walk entropy as a tractable surrogate for graph compactness, avoiding direct mutual information estimation. EW employs learnable random walks to select substructures and combines entropy regularization with task-specific objectives.
Critical strengths
Using structural entropy to guide the removal of task-irrelevant nodes is a reasonable and potentially promising idea.
Critical weaknesses
-
The overall framework illustrated in Figure 1 is unnecessarily complicated and could be presented more clearly.
-
The authors should clarify the differences and connections between this work and the following studies:
[1] Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism
[2] HuGE: An Entropy-driven Approach to Efficient and Scalable Graph Embeddings
[3] Better with Less: A Data-Active Perspective on Pre-Training Graph Neural Networks
-
Although the paper claims to conduct experiments on 15 datasets, the main performance comparisons are largely concentrated on the eight datasets reported in Tables 2 and 3, which substantially weakens the claimed experimental coverage. Moreover, most baselines are general-purpose graph representation learning methods, with very few directly addressing the same task and research objective as this paper.
-
The manuscript contains formatting and organizational errors. In particular, why does the appendix begin with Section 5.1? The section numbering and overall formatting should be carefully checked and corrected.
Questions for authors
See above Cons.