Pith. sign in

REVIEW 6 cited by

UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.13630 v3 pith:UN6763CB submitted 2024-02-21 cs.LG

classification cs.LG
keywords graphgraphslearningmodelstasksacrossdomainsfeatures
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Foundation models like ChatGPT and GPT-4 have revolutionized artificial intelligence, exhibiting remarkable abilities to generalize across a wide array of tasks and applications beyond their initial training objectives. However, graph learning has predominantly focused on single-graph models, tailored to specific tasks or datasets, lacking the ability to transfer learned knowledge to different domains. This limitation stems from the inherent complexity and diversity of graph structures, along with the different feature and label spaces specific to graph data. In this paper, we recognize text as an effective unifying medium and employ Text-Attributed Graphs (TAGs) to leverage this potential. We present our UniGraph framework, designed to learn a foundation model for TAGs, which is capable of generalizing to unseen graphs and tasks across diverse domains. Unlike single-graph models that use pre-computed node features of varying dimensions as input, our approach leverages textual features for unifying node representations, even for graphs such as molecular graphs that do not naturally have textual features. We propose a novel cascaded architecture of Language Models (LMs) and Graph Neural Networks (GNNs) as backbone networks. Additionally, we propose the first pre-training algorithm specifically designed for large-scale self-supervised learning on TAGs, based on Masked Graph Modeling. We introduce graph instruction tuning using Large Language Models (LLMs) to enable zero-shot prediction ability. Our comprehensive experiments across various graph learning tasks and domains demonstrate the model's effectiveness in self-supervised representation learning on unseen graphs, few-shot in-context transfer, and zero-shot transfer, even surpassing or matching the performance of GNNs that have undergone supervised training on target datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Attacking Graph Foundation Models Through Their Shared Representation

    cs.AI 2026-07 conditional novelty 6.0 of 10

    A shared representation layer in graph foundation models is a distinct attack surface: input edits break three of six models and one spectral tokenizer is uniquely fragile.

  2. H$^2$GFM: Towards unifying Homogeneity and Heterogeneity on Text-Attributed Graphs

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A graph foundation model with text-encoded meta-relations and a mixture of context-adaptive transformers improves accuracy across homogeneous and heterogeneous text-attributed graphs.

  3. MLaGA: Multimodal Large Language and Graph Assistant

    cs.AI 2025-06 conditional novelty 6.0 of 10

    MLaGA extends LLM-based graph reasoning from text-only graphs to multimodal graphs with image and text node attributes via a structure-aware aligner and multimodal instruction tuning.

  4. GRIP: In-Parameter Graph Reasoning through Fine-Tuning Large Language Models

    cs.CL 2025-11 reject novelty 5.0 of 10

    An LLM can memorize a knowledge graph into LoRA weights and answer relation/reasoning queries about it without graph context, but the evaluation partly trains on the test task.

  5. UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphs

    cs.LG 2025-02 conditional novelty 5.0 of 10

    A single pre-trained model, UniGraph2, creates a unified embedding space for multimodal graphs by combining CLIP encoders, a mixture-of-experts alignment layer, and a GNN, and it beats existing graph pre-training base...

  6. GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design

    cs.LG 2025-01 reject novelty 5.0 of 10

    A 55-template prompt benchmark showing general LLMs can beat specialized graph LLMs and GNNs on node classification and link prediction, though the reported margins are inflated by test-set prompt selection.

Pith tools