mlsanityData to 7 Oct 2026

GraphFM: A generalist graph transformer that learns transferable representations across diverse domains

arXiv 2407.11907 ↗First posted 16 Jul 2024cs.LG cs.SIcited by 14

Not on the map. Why?

Abstract (arXiv)

Graph neural networks (GNNs) are often trained on individual datasets, requiring specialized models and significant hyperparameter tuning due to the unique structures and features of each dataset. This approach limits the scalability and generalizability of GNNs, as models must be tailored for each specific graph type. To address these challenges, we introduce GraphFM, a scalable multi-graph pretraining approach designed for learning across diverse graph datasets. GraphFM uses a Perceiver-based encoder with learned latent tokens to compress domain-specific features into a shared latent space, enabling generalization across graph domains. We propose new techniques for scaling up graph training on datasets of different sizes, allowing us to train GraphFM on 152 distinct graph datasets, containing a total of 7.4 million nodes and 189 million edges. This allows us to study the effect of scale on pretraining across domains such as molecules, citation networks, and product graphs, and show that training on diverse datasets improves performance over single-source pretraining. Additionally, pretraining with a mixture of synthetic and real graphs enhances adaptability and stability, leading to competitive performance with state-of-the-art models across various node classification tasks. This approach reduces the burden of dataset-specific training and provides a single generalist model capable of performing across multiple diverse graph structures and tasks. Code is available at https://github.com/nerdslab/GraphFM.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 55 of its 77 references that are in the map. First posted on arXiv 16 Jul 2024.

Builds on

55 of 77 references.

References · 55

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2020Scaling Laws for Neural Language Modelscited by 6,411
  6. 2017Inductive Representation Learning on Large Graphscited by 6,284
  7. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  8. 2022Emergent Abilities of Large Language Modelscited by 2,483
  9. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  10. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  11. 2021Perceiver: General Perception with Iterative Attentioncited by 1,089
  12. 2020Simple and Deep Graph Convolutional Networkscited by 857
38 more
  1. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
  2. 2021How Attentive are Graph Attention Networks?cited by 818
  3. 2015Image-based Recommendations on Styles and Substitutescited by 702
  4. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
  5. 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
  6. 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 671
  7. 2020A Generalization of Transformer Networks to Graphscited by 653
  8. 2023A decoder-only foundation model for time-series forecastingcited by 650
  9. 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
  10. 2021Perceiver IO: A General Architecture for Structured Inputs & Outputscited by 616
  11. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
  12. 2019Multi-scale Attributed Node Embeddingcited by 543
  13. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
  14. 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
  15. 2017Representation Learning on Graphs: Methods and Applicationscited by 456
  16. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
  17. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
  18. 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
  19. 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 239
  20. 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 193
  21. 2022Structure-Aware Transformer for Graph Representation Learningcited by 191
  22. 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
  23. 2022Sign and Basis Invariant Networks for Spectral Graph Representation Learningcited by 176
  24. 2023Exphormer: Sparse Transformers for Graphscited by 166
  25. 2022NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphscited by 137
  26. 2022How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervisioncited by 102
  27. 2024Position: Graph Foundation Models are Already Herecited by 84
  28. 2024All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretrainingcited by 84
  29. 2023Towards Foundation Models for Knowledge Graph Reasoningcited by 83
  30. 2022Expander Graph Propagationcited by 75
  31. 2022Hierarchical Graph Transformer with Adaptive Node Samplingcited by 72
  32. 2023A Unified, Scalable Framework for Neural Population Decodingcited by 59
  33. 2022A Generalist Neural Algorithmic Learnercited by 58
  34. 2022GraphWorld: Fake Graphs Bring Real Insights for GNNscited by 56
  35. 2024Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Modelscited by 41
  36. 2023Towards Foundational Models for Molecular Learning on Large-Scale Multi-Task Datasetscited by 37
  37. 2022Synthetic Graph Generation to Benchmark Graph Learningcited by 16
  38. 2023Half-Hop: A graph upsampling approach for slowing down message passingcited by 13

50 most cited of 55 All 55 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

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

14 papers.

Sort:

By area: