- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper studies the component locality problem in spectral positional encodings (PEs). The authors show that global top-k eigenvector selection can change the representation of a component when an unrelated component is added. They formalize this problem and provide theoretical analysis. To address it, they propose CL-SPE, which selects eigenvectors independently for each connected component. Experiments on synthetic and real graphs show that CL-SPE can restore spectral and prediction locality. Further experiments on USPTO reaction graphs confirm that this problem exists in real applications. However, CL-SPE does not show significant improvement in downstream task performance.
Critical strengths
- Clear problem formulation and theoretical analysis. The paper identifies a component locality issue caused by global top-k spectral selection. It provides a formal definition, theoretical counterexamples, and sufficient conditions for restoring locality. This gives a clear explanation of a limitation in existing spectral positional encodings and provides a useful perspective for designing component-local representations.
Critical weaknesses
-
Unclear and disorganized presentation. The overall presentation is somewhat confusing and needs careful polishing. The motivation and main problem are not explained clearly enough, and many technical terms are introduced without sufficient explanation. For example, the terms such as "GlobalSelect-LocalSPE", "BudgetMatched", "ClusterComplete", and "contextual-SPE" in introduction without clearly explaining what they mean or how they differ. This makes the paper difficult to understand. The authors should better organize the presentation, explain the terminology more clearly, and improve the overall readability.
-
Limited methodological novelty and practical benefits. The proposed method mainly replaces global top-k selection with component-wise selection, which is quite straightforward. A simple method is not necessarily a weakness if it brings meaningful practical benefits. However, most experiments focus on KLE and prediction drift, where the improvements are largely expected from the experiment design. More importantly, the method does not show significant improvements in downstream task performance, which makes its overall contribution less convincing.
Questions for authors
-
What is the main novelty of the proposed method? The idea of selecting eigenvectors separately for each connected component seems quite straightforward, especially given the block-diagonal structure of the Laplacian. Could the authors explain more clearly how CL-SPE differs from existing component-wise spectral processing methods, and what new insights or advantages it provides beyond this simple change?
-
Why does restoring component locality matter in practice? The experiments show that CL-SPE can reduce KLE and prediction drift to nearly zero, but these improvements are largely expected from the experiment design. Moreover, the USPTO experiments do not show significant improvements in downstream prediction performance. Could the authors explain why component locality is important for practical graph learning tasks, and what benefits it brings beyond improving these locality metrics?