Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks

• URL: http://arxiv.org/abs/2511.06216v1
• Date: Sun, 09 Nov 2025 04:01:46 GMT
• Title: Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks
• Authors: Yanan Zhao, Feng Ji, Jingyang Dai, Jiaze Ma, Keyue Jiang, Kai Zhao, Wee Peng Tay,
• Abstract summary: Graph contrastive learning (GCL) learns node and graph representations by contrasting multiple views of the same graph.<n>We present an augmentation-free, multi-view GCL framework grounded in fractional-order continuous dynamics.
• Score: 28.779420227506545
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph contrastive learning (GCL) learns node and graph representations by contrasting multiple views of the same graph. Existing methods typically rely on fixed, handcrafted views-usually a local and a global perspective, which limits their ability to capture multi-scale structural patterns. We present an augmentation-free, multi-view GCL framework grounded in fractional-order continuous dynamics. By varying the fractional derivative order $\alpha \in (0,1]$, our encoders produce a continuous spectrum of views: small $\alpha$ yields localized features, while large $\alpha$ induces broader, global aggregation. We treat $\alpha$ as a learnable parameter so the model can adapt diffusion scales to the data and automatically discover informative views. This principled approach generates diverse, complementary representations without manual augmentations. Extensive experiments on standard benchmarks demonstrate that our method produces more robust and expressive embeddings and outperforms state-of-the-art GCL baselines.

Related papers

• GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning [50.40400074353263]
  Graph Neural Networks (GNNs) are powerful tools for precessing relational data but often struggle to generalize to unseen graphs.<n>We introduce textbfGraph textbfIn-context textbfL textbfTransformer (GILT), a framework built on an LLM-free and tuning-free architecture.
  arXiv  Detail & Related papers  (2025-10-06T08:09:15Z)
• Scalable Graph Generative Modeling via Substructure Sequences [50.32639806800683]
  We introduce Generative Graph Pattern Machine (G$2$PM), a generative Transformer pre-training framework for graphs.<n>G$2$PM represents graph instances (nodes, edges, or entire graphs) as sequences of substructures.<n>It employs generative pre-training over the sequences to learn generalizable and transferable representations.
  arXiv  Detail & Related papers  (2025-05-22T02:16:34Z)
• Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks [24.778889911467438]
  Graph Contrastive Learning (GCL) has recently made progress as an unsupervised graph representation learning paradigm.<n>We introduce a novel augmentation-free GCL framework based on graph neural diffusion models.<n>We demonstrate that our model does not require negative samples for training and is applicable to both homophilic and heterophilic datasets.
  arXiv  Detail & Related papers  (2025-04-23T14:17:28Z)
• AS-GCL: Asymmetric Spectral Augmentation on Graph Contrastive Learning [25.07818336162072]
  Graph Contrastive Learning (GCL) has emerged as the foremost approach for self-supervised learning on graph-structured data.<n>We propose a novel paradigm called AS-GCL that incorporates asymmetric spectral augmentation for graph contrastive learning.<n>Our method introduces significant enhancements to each of these components.
  arXiv  Detail & Related papers  (2025-02-19T08:22:57Z)
• Tensor-Fused Multi-View Graph Contrastive Learning [12.412040359604163]
  Graph contrastive learning (GCL) has emerged as a promising approach to enhance graph neural networks' (GNNs) ability to learn rich representations from unlabeled graph-structured data.<n>Current GCL models face challenges with computational demands and limited feature utilization.<n>We propose TensorMV-GCL, a novel framework that integrates extended persistent homology with GCL representations and facilitates multi-scale feature extraction.
  arXiv  Detail & Related papers  (2024-10-20T01:40:12Z)
• Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modeling [60.0185734837814]
  Graph neural networks (GNNs) have found extensive applications in learning from graph data. To bolster the generalization capacity of GNNs, it has become customary to augment training graph structures with techniques like graph augmentations. This study introduces the concept of Mixture-of-Experts (MoE) to GNNs, with the aim of augmenting their capacity to adapt to a diverse range of training graph structures.
  arXiv  Detail & Related papers  (2023-04-06T01:09:36Z)
• Graph Contrastive Learning with Personalized Augmentation [17.714437631216516]
  Graph contrastive learning (GCL) has emerged as an effective tool for learning unsupervised representations of graphs. We propose a principled framework, termed as textitGraph contrastive learning with textitPersonalized textitAugmentation (GPA) GPA infers tailored augmentation strategies for each graph based on its topology and node attributes via a learnable augmentation selector.
  arXiv  Detail & Related papers  (2022-09-14T11:37:48Z)
• Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming [48.99614465020678]
  We introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming. This mechanism enables G-Zoom to explore and extract self-supervision signals from a graph from multiple scales. We have conducted extensive experiments on real-world datasets, and the results demonstrate that our proposed model outperforms state-of-the-art methods consistently.
  arXiv  Detail & Related papers  (2021-11-20T22:45:53Z)
• AutoGCL: Automated Graph Contrastive Learning via Learnable View Generators [22.59182542071303]
  We propose a novel framework named Automated Graph Contrastive Learning (AutoGCL) in this paper. AutoGCL employs a set of learnable graph view generators orchestrated by an auto augmentation strategy. Experiments on semi-supervised learning, unsupervised learning, and transfer learning demonstrate the superiority of our framework over the state-of-the-arts in graph contrastive learning.
  arXiv  Detail & Related papers  (2021-09-21T15:34:11Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Graph Contrastive Learning with Augmentations [109.23158429991298]
  We propose a graph contrastive learning (GraphCL) framework for learning unsupervised representations of graph data. We show that our framework can produce graph representations of similar or better generalizability, transferrability, and robustness compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-10-22T20:13:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.