- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes Hierarchical Spectral Learning (HSL), a locality-first multiresolution spectral framework. HSL combines graph topology and feature similarity to construct a multi-view geometry, refines the fused geometry using diffusion coherence, recursively constructs a diffusion-coherent hierarchy through spectral partitioning, and derives degree-aware Haar scaling and contrast components. It then learns frequency- and resolution-dependent responses over the resulting localized multiresolution components. The paper provides theoretical results for successive linear spatial operators under a fixed hierarchy. It evaluates HSL on node classification, graph classification, and community detection, and further studies oversmoothing, oversquashing, hub-degree bias, and scalability.
Critical strengths
- The principle of locality before frequency is clear and technically interesting.
- The empirical study covers node classification, graph classification, and community detection, together with depth-wise contrast preservation, degree-stratified analysis, hierarchy and filter ablations, and scalability studies.
Critical weaknesses
- The entire hierarchy tree is precomputed in a one-off manner prior to training and remains fixed throughout the training process. This strategy lacks adaptivity across different types of graphs. Moreover, errors in hierarchical partitioning will perpetually propagate downstream, with no mechanism to correct mispartitioning during training.
- The relationship between theoretical guarantees and underlying assumptions is not clearly established. All theorems are derived for linear spatial operators and neglect the MLP non-linearities and skip connections within the network. Furthermore, the diffusion-coherent hierarchy relies on spectral clustering with k-means, which introduces randomness. Corresponding theoretical analysis is missing.
Questions for authors
- The near-linear hierarchy-construction claim in line 470 needs further justification. At each level, the method applies k-means with K_l clusters to a q_l-dimensional spectral embedding, while K_l = max{1,⌊r n_l ⌋} scales with n_l. The complexity analysis does not explicitly account for this clustering step, feature k-nearest-neighbor construction, or the clustering variant and iteration budget.
- Section 2.3 explicitly limits its theoretical results to successive linear spatial operators under a fixed hierarchy, excluding the learned feature transformations and nonlinearities in Eq. (4).
- In line 165, D_coh may have a zero diagonal entry if diffusion gating removes all incident candidate edges, making the normalized Laplacian undefined. The later correction μ_i = d_i^coh + δ does not resolve this earlier normalization issue. Please clarify how zero-degree nodes are handled.
- Why is the effective frequency defined with L_mix in line 242 when the hierarchy is constructed from L_coh? Please clarify why these two geometries are used for different stages.
- The hierarchy is constructed using the randomized heat embedding Y_t = p_(K_d ) (L_mix)R, but the paper does not assess how different draws of R, the projection dimension q_d, or the polynomial order K_d affect the resulting hierarchy. How stable is the hierarchy across these approximation settings?
- Table 4 reports only task accuracy as evidence of oversquashing mitigation. Can the authors report the source-target sensitivity ‖∂h_v^((l))/∂x_u ‖ introduced in Section 1.1 to directly verify that the gains arise from hierarchy-mediated communication rather than predictive performance alone?
- Figure 1 weights the root scaling term as γ_0 P_0 X, whereas line 248 defines it as P_0 X without γ_0; it also uses S_topo rather than S_top. Figure 2 uses k - 1 and states |C| - 1 contrast directions, whereas lines 226–230 specify m - 1 for a region with m children. These annotations should be reconciled with Section 2.
- Table 1 is not fully documented: the symbols † and ‡ are undefined.
- In Figures 3 and 4, the proposed method is labeled “HMH (Ours)” in the legends rather than “HSL (Ours).” Why this inconsistency?