FIMP: Foundation Model-Informed Message Passing for Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Foundation models have achieved remarkable success across many domains, relying on pretraining over vast amounts of data. Graph-structured data often lacks the same scale as unstructured data, making the development of graph foundation models challenging. In this work, we propose Foundation-Informed Message Passing (FIMP), a Graph Neural Network (GNN) message-passing framework that leverages pretrained non-textual foundation models in graph-based tasks. We show that the self-attention layers of foundation models can effectively be repurposed on graphs to perform cross-node attention-based message-passing. Our model is evaluated on a real-world image network dataset and two biological applications (single-cell RNA sequencing data and fMRI brain activity recordings) in both finetuned and zero-shot settings. FIMP outperforms strong baselines, demonstrating that it can effectively leverage state-of-the-art foundation models in graph tasks.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 32 of its 65 references that are in the map. First posted on arXiv 17 Oct 2022.
Builds on
32 of 65 references.
References · 32
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
20 more
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,565
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2021Florence: A New Foundation Model for Computer Visioncited by 804
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2020A Generalization of Transformer Networks to Graphscited by 661
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2019Graph Transformer Networkscited by 523
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
- 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 448
- 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 186
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025A Survey of Context Engineering for Large Language Modelscited by 126
- 2025A Survey of Context Engineering for Large Language Models17 Jul 2025