- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses the gradient conflict problem in attributed graph clustering (AGC). Existing work often combines multiple complementary objectives (augmentation consistency, neighborhood attraction, and non-edge separation), and leads to incompatible encoder updates and degraded cluster structures. To resolve this, the authors propose CACB that introduces objective-specific linear projections to disentangle attraction and separation supervisory signals into dedicated metric spaces. Further, when the natural aggregate gradient violates first-order compatibility (), CACB performs a minimal 1D rebalancing between attraction and separation gradients while fixing the base consistency anchor and total relational budget. Evaluation results on six benchmark datasets show that CACB consistently outperforms eight competitive baselines and standard multi-task optimization strategies, which demonstrate the effectiveness of explicitly coordinating gradient compatibility for AGC.
Critical strengths
S1: Unlike existing deep AGC work that concentrates on designing heuristic loss combinations, this work identifies and tackles the fundamental problem of gradient conflict among heterogeneous objectives on a shared encoder. Shifting the focus from loss formulation to explicit first-order gradient compatibility is insightful and addresses a fundamental issue in multi-objective graph representation learning.
S2: The proposed 1D rebalancing formulation along is elegant. By freezing the consistency anchor weight and conserving the total relational budget, the algorithm avoids solving complex and computationally extensive problems.
Critical weaknesses
W1: The empirical evaluation is restricted to moderate-sized homophilic graphs. In heterophilic graph settings, neighborhood attraction inherently contradicts the underlying clustering structure, leading to severe and persistent gradient conflicts with and . It is unclear whether CACB can perform well under this setting. Moreover, evaluation on larger-scale benchmarks is missing.
W2: This paper relies entirely on full-batch GNN training. How CACB performs under stochastic mini-batch graph sampling, where gradient variance could make cosine compatibility checks noisy and erratic, is neither analyzed nor discussed.
Questions for authors
Q1: How does CACB perform on graphs with low homophily? When edges connect cross-class nodes, does the neighborhood attraction gradient persistently conflict with the clustering objective?
Q2: Can the authors provide results or discuss the empirical feasibility of scaling CACB to larger graphs?
Q3: In real-world AGC scenarios where graphs do not fit into single GPU memory, mini-batch training is standard. How sensitive is the compatibility condition to mini-batch gradient noise? Does high gradient variance cause to oscillate unstably across mini-batches?