Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks
Not on the map. Why?
Abstract (arXiv)
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 α ∈ (0,1], our encoders produce a continuous spectrum of views: small α yields localized features, while large α induces broader, global aggregation. We treat α 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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 48 of its 62 references that are in the map. First posted on arXiv 9 Nov 2025.
Builds on
48 of 62 references.
References · 48
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2018Deep Graph Infomaxcited by 1,101
- 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
36 more
- 2020Deep Graph Contrastive Representation Learningcited by 535
- 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
- 2018Adversarial Attacks on Neural Networks for Graph Datacited by 395
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2021Graph Contrastive Learning Automatedcited by 287
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2021GRAND: Graph Neural Diffusioncited by 258
- 2020Graph Representation Learning via Graphical Mutual Information Maximizationcited by 217
- 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
- 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 184
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2021From Canonical Correlation Analysis to Self-supervised Graph Neural Networkscited by 138
- 2022Graph-Coupled Oscillator Networkscited by 123
- 2021Robustness of Graph Neural Networks at Scalecited by 100
- 2021Augmentation-Free Self-Supervised Learning on Graphscited by 94
- 2021Beltrami Flow and Neural Diffusion on Graphscited by 84
- 2022GREAD: Graph Neural Reaction-Diffusion Networkscited by 54
- 2022Adversarial Graph Contrastive Learning with Information Regularizationcited by 38
- 2023Simple and Asymmetric Graph Contrastive Learning without Augmentationscited by 37
- 2022On the Robustness of Graph Neural Diffusion to Topology Perturbationscited by 30
- 2023Graph Neural Convection-Diffusion with Heterophilycited by 26
- 2024Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FRONDcited by 16
- 2022Single-Pass Contrastive Learning Can Work for Both Homophilic and Heterophilic Graphcited by 14
- 2023Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspectivecited by 13
- 2023Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networkscited by 12
- 2022Localized Contrastive Learning on Graphscited by 10
- 2024Coupling Graph Neural Networks with Fractional Order Continuous Dynamics: A Robustness Studycited by 9
- 2024Distributed-Order Fractional Graph Operating Networkcited by 7
- 2025LOHA: Direct Graph Spectral Contrastive Learning Between Low-pass and High-pass Viewscited by 6
- 2023Certifiably Robust Graph Contrastive Learningcited by 5
- 2024Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?cited by 5
- 2025Neural Variable-Order Fractional Differential Equation Networkscited by 5
- 2024Community-Invariant Graph Contrastive Learningcited by 4
- 2025Efficient Training of Neural Fractional-Order Differential Equation via Adjoint Backpropagationcited by 3
- 2023Graph Neural Networks with a Distribution of Parametrized Graphscited by 1
- 2024Edge Contrastive Learning: An Augmentation-Free Graph Contrastive Learning Modelcited by 1
Built on by
Not cited yet.