mlsanityData to 7 Oct 2026

A Survey on Self-Supervised Graph Foundation Models: Knowledge-Based Perspective

arXiv 2403.16137 ↗First posted 24 Mar 2024cs.LG cs.SIcited by 9

Not on the map. Why?

Abstract (arXiv)

Graph self-supervised learning (SSL) is now a go-to method for pre-training graph foundation models (GFMs). There is a wide variety of knowledge patterns embedded in the graph data, such as node properties and clusters, which are crucial to learning generalized representations for GFMs. However, existing surveys of GFMs have several shortcomings: they lack comprehensiveness regarding the most recent progress, have unclear categorization of self-supervised methods, and take a limited architecture-based perspective that is restricted to only certain types of graph models. As the ultimate goal of GFMs is to learn generalized graph knowledge, we provide a comprehensive survey of self-supervised GFMs from a novel knowledge-based perspective. We propose a knowledge-based taxonomy, which categorizes self-supervised graph models by the specific graph knowledge utilized. Our taxonomy consists of microscopic (nodes, links, etc.), mesoscopic (context, clusters, etc.), and macroscopic knowledge (global structure, manifolds, etc.). It covers a total of 9 knowledge categories and more than 25 pretext tasks for pre-training GFMs, as well as various downstream task generalization strategies. Such a knowledge-based taxonomy allows us to re-examine graph models based on new architectures more clearly, such as graph language models, as well as provide more in-depth insights for constructing GFMs.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 244 of its 382 references that are in the map. First posted on arXiv 24 Mar 2024.

Builds on

244 of 382 references.

References · 244

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  5. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  6. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  7. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  8. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  9. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  10. 2017Graph Attention Networkscited by 8,854
  11. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  12. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
38 more
  1. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  4. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  5. 2018How Powerful are Graph Neural Networks?cited by 4,355
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  7. 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
  8. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
  9. 2022Emergent Abilities of Large Language Modelscited by 2,483
  10. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  11. 2022Survey of Hallucination in Natural Language Generationcited by 2,056
  12. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
  13. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  14. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
  15. 2016Variational Graph Auto-Encoderscited by 1,373
  16. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  17. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  18. 2018Deep Graph Infomaxcited by 1,101
  19. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
  20. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
  21. 2019Strategies for Pre-training Graph Neural Networkscited by 964
  22. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
  23. 2023Large Language Modelscited by 774
  24. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
  25. 2018MINE: Mutual Information Neural Estimationcited by 680
  26. 2023Unifying Large Language Models and Knowledge Graphs: A Roadmapcited by 663
  27. 2020A Generalization of Transformer Networks to Graphscited by 653
  28. 2020Contrastive Multi-View Representation Learning on Graphscited by 651
  29. 2020Deep Graph Contrastive Representation Learningcited by 535
  30. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
  31. 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
  32. 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
  33. 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 443
  34. 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
  35. 2018Deep Learning on Graphs: A Surveycited by 393
  36. 2019KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representationcited by 356
  37. 2023Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoningcited by 326
  38. 2021Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Losscited by 311

50 most cited of 244 All 244 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 6.

9 papers.