- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper observes that the degree normalization commonly used in graph neural networks induces a spectral “valley” effect, attenuating a fixed mid-frequency band centered at (\lambda = 1), where the eigenvalues of dense graphs tend to concentrate. Based on this observation, the authors propose learning the location, sharpness, and flank gains of this valley for each graph, and provide theoretical analyses and empirical evaluations of the proposed method.
Critical strengths
1.The authors propose a learnable aggregation stage that generalizes degree normalization and determines the available spectral energy budget for each downstream filter.
2.The paper provides theoretical analyses to support its claims and explains the effectiveness of the proposed method from the perspectives of eigenvalue distributions, label energy, and filtering capacity.
3.The proposed SpecValley model achieves strong performance in several experimental settings.
Critical weaknesses
1.The theoretical analysis in Section 4.3 is difficult to follow.
2.The paper motivates SpecValley by observing that the conventional spectral response vanishes at (\lambda = 1), and proposes making the spectral response of the aggregation stage learnable. However, the paper does not provide a sufficiently detailed theoretical and empirical analysis to establish whether the zero response at (\lambda = 1) actually leads to degraded classification performance.
3.If the authors believe that the spectral response harms classification performance, why not design a filter such as (1-\lambda/2), whose response is nonzero at (\lambda = 1), to preserve model performance, rather than introducing a computationally expensive aggregation stage?
4.The proposed method requires eigendecomposition, which may be prohibitively expensive for large graphs, such as OGBN-Arxiv.
5.Section 5.1 includes experimental analysis, which seems unusual, as this section should focus on describing the datasets and experimental settings.
6.The relationship between label energy and downstream classification performance requires further investigation to explain the performance implications of a zero spectral response at (\lambda = 1).
7.Table captions should be placed above the tables.
8.Figure 3 is too tall, and Table 3 should be placed to the right of the text.
Questions for authors
1.Could the authors design a filter such as (1-\lambda/2), whose response is nonzero at (\lambda = 1), to preserve model performance?
2.Does a zero spectral response at (\lambda = 1) lead to degraded classification performance? Could the authors provide more detailed theoretical and empirical evidence to support their claims?
3.What is the computational cost of performing eigendecomposition on a large graph such as OGBN-Arxiv?
4.Could the theoretical analysis in Section 4.3 be rewritten in a more accessible and easier-to-understand manner?
Thank you for your review
We would like to thank you very much for the detailed reviews and the points you raised. Our current inclination is to take up your feedback and to develop the paper further from a method paper into an analytical paper, placing the focus more on the supporting property of improving the input representations with 1 − λ and less on a flexible, learned form of the spectral valley. We would try to explain in more depth why the mechanism works and to considerably extend the dataset basis.
We are very grateful for your reviews and your feedback, which have been helpful for the further development of this work.