- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a graph diffusion-based framework for representation learning that solve spectral heterogeneity in graph signals. To achieve that purpose, this work introduces a learnable spectral response strategy to adapt noise perturbation across different frequencies and a frequency-aware reconstruction objective to guide the denoising process. Experiments on node and graph classification tasks show competitive performance.
Critical strengths
-
Using diffusion models for representation learning is an interesting research direction.
-
The paper has a clear line of reasoning. This paper (Section 3 and Figure 1) provides a clear, quantitative analysis of an important and interesting motivation before introducing the proposed method.
-
The ablation studies (Tables 2 and 6) provide consistent evidence that removing the proposed key components reduces performance on the corresponding tasks.
Critical weaknesses
-
The current visualizations mainly show that the model improves the spectral reconstruction objective it explicitly optimizes. However, they do not clearly demonstrate whether the frequency-adaptive mechanism preserves more useful information for downstream tasks.
-
Theorem 4.1 mainly relies on the classical approximation properties of Bernstein polynomials to establish their greater expressiveness compared to constant functions. But this does not necessarily imply that learning a noise response using this parameterization leads to better representations.
Questions for authors
-
If high-frequency signals are already more susceptible to information loss than low-frequency signals, why does the learned spectral response further increase noise at higher frequencies? Could the authors explain the relationship between Figures 4(b) and 1(b)?
-
I am curious why assigning reconstruction weights based solely on spectral response coefficients can reflect the reliability of different spectral bands. Authors should give more hints about the motivation behind this design.
-
How are node features constructed for graph classification datasets that do not provide original node attributes?
2 comments
Response to authors
Thank you for your response. This addresses my concerns, and I will maintain my positive rating.
Response to Reviewer
We thank the reviewer for valuable comments.
W1: Figures 4(b) and 5 explain response allocation and band-wise recovery. Beyond these spectral analyses, downstream benefits are evaluated through classification: Table 2 shows that removing either the forward spectral response or adaptive reconstruction weights reduces accuracy. To further evaluate the frequency-adaptive mechanism, we added classification comparisons at matched noise power against tuned and learnable global scalar responses and fixed increasing and decreasing spectral profiles. The results below on Photo provide evidence independent of spectral reconstruction metrics, supporting the benefit of adaptive frequency allocation for learning task-relevant representations. Full results are provided in Appendix I.2 of the revised manuscript.
W2: Section 3 shows that a uniform response only scales noise globally and cannot adjust relative SNRs across frequencies. In contrast, Bernstein parameterization can express nonmonotonic response profiles, allowing diffusion to adapt to the spectral heterogeneity of graph signals. Theorem 4.1 establishes the expressive capacity, while classification and ablation studies evaluate representation quality. Specifically, the matched-noise-power comparisons in W1 show that the learned response outperforms scalar and fixed profiles, thereby providing empirical evidence of improved graph representations.
Q1: Figures 1(b) and 4(b) describe different settings. Figure 1(b) shows frequency-dependent sensitivity under uniform perturbation, revealing that high-frequency information is more susceptible to loss. In contrast, Figure 4(b) shows the spectral responses learned through joint training to adapt to these spectral characteristics. Our goal is to learn useful representations through denoising, rather than simply minimize perturbation or equalize SNRs across frequencies. Specifically, weak perturbation may make reconstruction too easy, while excessive perturbation can destroy recoverable information. Therefore, we learn the allocation of perturbations across frequencies jointly with the reconstruction objective. Under this objective, greater high-frequency sensitivity does not imply that the learned response must decrease with frequency. Moreover, on Computer, the response in Figure 4(b) declines at higher frequencies, showing that the model can learn nonmonotonic allocations from data rather than enforcing an increasing profile.
Q2: This design allocates reverse reconstruction supervision according to forward perturbation strength. Specifically, Section 3 shows that, for fixed signal and base noise power, a smaller spectral response yields lower injected noise power and a higher SNR. Therefore, inverse-response weighting prioritizes less perturbed spectral bands and prevents heavily perturbed bands from dominating the reconstruction objective. However, since each band’s actual SNR also depends on its signal and base noise power, these weights represent response-guided supervision allocation rather than a direct estimate of spectral reliability. Through this allocation, the shared response allows reconstruction supervision to adapt jointly with forward perturbation, which motivates our design.
Q3: For graph classification datasets without original node attributes, we use one-hot encodings of node degrees as node features.