Disentangle-then-Refine: LLM-Guided Decoupling and Structure-Aware Refinement for Graph Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Conventional Graph Contrastive Learning (GCL) on Text-Attributed Graphs (TAGs) relies on blind stochastic augmentations, inadvertently entangling task-relevant signals with noise. We propose SDM-SCR, a robust framework anchored in Approximate Orthogonal Decomposition. First, the Semantic Decoupling Module (SDM) leverages the instruction-following capability of Large Language Models (LLMs) to actively parse raw attributes into asymmetric, task-oriented signal and noise views. This shifts the paradigm from random perturbation to semantic-aware disentanglement. Subsequently, Semantic Consistency Regularization (SCR) exploits the spectral observation that semantic signals are topologically smooth while residual noise is high-frequency. SCR functions as a selective spectral filter, enforcing consistency only on the signal subspace to eliminate LLM hallucinations without over-smoothing. This ``Disentangle-then-Refine'' mechanism ensures rigorous signal purification. Extensive experiments demonstrate that SDM-SCR achieves SOTA performance in accuracy and efficiency.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 29 references that are in the map. First posted on arXiv 16 Apr 2026.
Builds on
21 of 29 references.
References · 21
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
- 2020Deep Graph Contrastive Representation Learningcited by 535
- 2021Graph Self-Supervised Learning: A Surveycited by 289
- 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 253
- 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 184
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2021Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Predictioncited by 137
- 2020Minimal Variance Sampling with Provable Guarantees for Fast Training of Graph Neural Networkscited by 54
- 2019Deep Representation Learning for Social Network Analysiscited by 35
- 2024Towards Graph Contrastive Learning: A Survey and Beyondcited by 26
9 more
- 2023HomoGCL: Rethinking Homophily in Graph Contrastive Learningcited by 18
- 2024GAugLLM: Improving Graph Contrastive Learning for Text-Attributed Graphs with Large Language Modelscited by 16
- 2024Graph-based Unsupervised Disentangled Representation Learning via Multimodal Large Language Modelscited by 9
- 2024Leveraging Graph Structures to Detect Hallucinations in Large Language Modelscited by 7
- 2024ERGNN: Spectral Graph Neural Network With Explicitly-Optimized Rational Graph Filterscited by 5
- 2024LATEX-GCL: Large Language Models (LLMs)-Based Data Augmentation for Text-Attributed Graph Contrastive Learningcited by 4
- 2025InfoNCE is a Free Lunch for Semantically guided Graph Contrastive Learningcited by 3
- 2025Refining Interactions: Enhancing Anisotropy in Graph Neural Networks with Language Semanticscited by 2
- 2025Benchmarking Fairness-aware Graph Neural Networks in Knowledge Graphscited by 2
Built on by
Not cited yet.