- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper addresses the problem of structural encoding recomputation changing predictions on existing nodes after graph extension and formalizes Graph Extension Consistency (GEC). Theoretically, it proves spectral subspace discrepancies under disjoint and weak-bridge extensions for spectral encodings that select a fixed number of low-frequency Laplacian modes with strictly positive eigenvalues. Experimentally, it investigates the effects of encoding recomputation on predictions and demonstrates changes in predicted probabilities across multiple datasets and encoding methods.
Critical strengths
- The theoretical result that consistency can fail under weak-bridge extensions even when it holds under disjoint extensions is interesting.
Critical weaknesses
-
Insufficient motivation and significance of the problem setting.
- Although graph extension consistency is an interesting problem, the paper does not sufficiently explain when and why this property matters in practical graph learning. In particular, it is unclear how naturally the assumptions of the proposed setting arise in practice. Moreover, since changes in predictions do not necessarily imply degraded performance, it is difficult to assess the practical significance of the problem.
-
Major issues with organization and clarity.
- The relationships among the problem setting, theoretical contributions, and experimental validation are not clearly organized, making the paper's central claims difficult to understand even after careful reading. Many definitions and assumptions are introduced without sufficient background or intuitive explanations. The poor readability makes it difficult to properly assess the significance of the theoretical results.
Questions for authors
- Could the authors provide concrete examples of practical scenarios where the proposed setting is important? In particular, the reviewer would like to understand situations where structural encodings must be recomputed after adding irrelevant graph regions, even though the task-relevant information for existing nodes remains unchanged.