- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes ASPECT, a graph contrastive learning framework that adaptively combines low- and high-frequency representations using node-wise gating guided by channel-wise contrastive losses. It further introduces ASPECT-S, which incorporates perturbation sensitivity to improve robustness.
Critical strengths
- The paper presents extensive experiments on both homophilic and heterophilic graphs, with ablation studies
Critical weaknesses
-
The research gap claim is overstated. The research motivation overlooks a substantial body of work on node-adaptive spectral filtering. FAGCN (AAAI 2021), ACM-GNN (NeurIPS 2022), and many more. This already investigates adaptive frequency selection or node-specific filter mixing.
-
Weak theoretical motivation and insufficient connection to the proposed methodology.
Section 2 attempts to establish the limitations of existing methods and motivate the architecture introduced in Section 3. However, the theoretical analysis does not adequately achieve this objective.
Theorem 2.1 provides a limited theoretical contribution. The nonnegative regret of global fusion relative to a node-wise oracle follows directly from the inclusion of their optimization domains. The positive lower bound additionally assumes separated node-wise preferences and quadratic risk growth, which already impose a penalty for using a shared coefficient. But the theorem analyzes an unrestricted oracle rather than the proposed learned gating function and provides no guarantee that ASPECT approaches this oracle. The authors should justify these assumptions empirically
- Theorem 2.2 is a direct consequence of Lipschitz continuity and does not exploit any graph-specific or spectral properties. More importantly, the bound controls a contrastive surrogate rather than downstream classification performance. The analysis also simplifies the dependence of InfoNCE on other node representations that may change under graph perturbations. Therefore, it is unclear what specific theoretical insight this result provides for the proposed stability-aware spectral fusion mechanism.
The author should consider rewriting section 2 and its theme to avoid restating general limitations of globally shared fusion and perturbation-sensitive representations. Also, provide direct theoretical evidence or motivation for why their proposed model is better suited to solve the limitation.
-
ASPECT/prposed model does not directly learn which spectral mixture is best for a node. Instead, it constructs a pseudo-target from the individual contrastive losses of two channels and trains the gate to imitate that target. A channel with a higher individual contrastive loss may still provide important information that improves the fused representation. The authors do not establish that independently measured channel losses are reliable indicators of the optimal fusion coefficient. Also, there is a ton of paper that uses combines both this frequency. This leads to oversmooting and oversquashing, which also has been studied extensively. For example, the paper "Multi-Track Message Passing: Tackling Oversmoothing and Oversquashing in Graph Learning via Preventing Heterophily Mixing" studies this and propose to use multi-track for keeping the frequency unmixed. Based on the previous research, I assume the Proposed method will be susceptible to oversmoothing and oversquashing.
-
The method implicitly treats lower channel-wise contrastive loss as evidence of higher channel utility. This assumption is not sufficiently justified, particularly for heterophilic graphs where high-frequency representations may contain important discriminative information while being less consistent under graph augmentations. The authors should investigate whether the learned channel preferences correlate with downstream discriminative utility rather than only with the contrastive objective used to construct the pseudo-target.
-
The policy target is generated from the same evolving channel representations that are jointly optimized with the gate. Although the target is detached, it is not independent of the model. This introduces a potential self-reinforcing feedback mechanism in which initially favored channels receive larger fusion weights, potentially reinforcing early training biases. This can also lead to representational collapse, as the model can try to cheat the loss by making all the representation space similar. For better understanding of this phenomenon, look at models such as the Burlow Twin or the Jepa model. This is not a graph model, but it talks about how representation collapse happens if the target is coming from the same evolving channel representations that are jointly optimized with the gate.
-
The Rayleigh-based perturbation objective is poorly motivated. It encourages perturbations that reduce or reverse the expected spectral ordering of the low- and high-frequency channels, but the authors do not explain why this should improve robustness. Moreover, changes in Rayleigh energy may result from graph topology changes rather than spectral-filter instability. Stronger justification and comparisons with alternative objectives are needed.
Questions for authors
Why should the individual contrastive losses of the low- and high-frequency channels reliably determine their optimal fusion weights, especially when the channels contain complementary information?