GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks
Not on the map. Why?
Abstract (arXiv)
Graphs are widely used to model relational systems, with applications in domains such as social networks, finance, and biomedicine. Graph neural networks (GNNs) have become a mainstream approach for learning graph representations. With the rise of large language models (LLMs), recent studies have attempted to combine GNNs with LLMs. However, most existing works concentrate on node-level and edge-level tasks, while graph-level tasks, which require capturing more complex structural and feature information, remain relatively underexplored. Moreover, graph pretraining is a widely adopted strategy to alleviate the challenge of label scarcity. Most existing approaches are designed solely for GNNs such as GraphCL, leaving LLMs uninvolved in the process. To address these limitations, we propose GLIP, a Graph-LLM JoInt Pretraining framework for graph-level tasks. GLIP first performs graph augmentation to construct positive and negative pairs and introduces a multi-token selection strategy to identify patches informative in both structure and features. It further leverages a diffusion-based projector to enrich them with contextual information, enabling GLIP to capture signals from both global and local perspectives. Finally, GLIP employs a joint objective that integrates the LLM's semantic judgments with a contrastive alignment loss, ensuring consistent supervision at both the semantic and structural levels. After pretraining, GLIP is fine-tuned with limited labeled data for downstream tasks, and extensive experiments show that it outperforms state-of-the-art methods on graph-level classification and reasoning tasks. Our source code is publicly available at https://anonymous.4open.science/r/GLIP.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 44 references that are in the map. First posted on arXiv 29 Jun 2026.
Builds on
26 of 44 references.
References · 26
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2023Qwen Technical Reportcited by 3,344
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
14 more
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 494
- 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 448
- 2023Exploring the Potential of Large Language Models (LLMs) in Learning on Graphscited by 274
- 2023Can Language Models Solve Graph Problems in Natural Language?cited by 252
- 2020Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsterscited by 250
- 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 243
- 2023GPT4Graph: Can Large Language Models Understand Graph Structured Data ? An Empirical Evaluation and Benchmarkingcited by 210
- 2023Large Language Models on Graphs: A Comprehensive Surveycited by 192
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2024GraphTranslator: Aligning Graph Model to Large Language Model for Open-ended Taskscited by 63
- 2020GCN-Based User Representation Learning for Unifying Robust Recommendation and Fraudster Detectioncited by 54
- 2023Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?cited by 31
- 2025When Do LLMs Help With Node Classification? A Comprehensive Analysiscited by 21
Built on by
Not cited yet.