Pith. sign in

REVIEW 4 cited by

Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models

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 2405.13934 v4 pith:Q5MRRTNT submitted 2024-05-22 cs.LG

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

Given the ubiquity of graph data, it is intriguing to ask: Is it possible to train a graph foundation model on a broad range of graph data across diverse domains? A major hurdle toward this goal lies in the fact that graphs from different domains often exhibit profoundly divergent characteristics. Although there have been some initial efforts in integrating multi-domain graphs for pre-training, they primarily rely on textual descriptions to align the graphs, limiting their application to text-attributed graphs. Moreover, different source domains may conflict or interfere with each other, and their relevance to the target domain can vary significantly. To address these issues, we propose MDGPT, a text free Multi-Domain Graph Pre-Training and adaptation framework designed to exploit multi-domain knowledge for graph learning. First, we propose a set of domain tokens to to align features across source domains for synergistic pre-training. Second, we propose a dual prompts, consisting of a unifying prompt and a mixing prompt, to further adapt the target domain with unified multi-domain knowledge and a tailored mixture of domain-specific knowledge. Finally, we conduct extensive experiments involving six public datasets to evaluate and analyze MDGPT, which outperforms prior art by up to 37.9%.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Beyond Feature and Structure Alignment: Learning Transferable Propagation Knowledge for Graph Foundation Models

    cs.LG 2026-07 conditional novelty 6.0 of 10

    ProGFM transfers graph knowledge across domains by learning a prototype bank of per-edge, per-dimension propagation strengths and using them to modulate message passing on unseen graphs.

  2. CHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer

    cs.AI 2026-07 conditional novelty 6.0 of 10

    CHARM improves zero-shot transfer on multimodal product graphs by replacing raw nodes with hierarchical semantic contexts and modality-complementary bridges that are encoded as LLM-readable tokens.

  3. What Makes Graph Unified? Principles and Generative Sliding-Window Transformer for Graph Foundation Models

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Ordering node features by topological smoothness and encoding them with a shared sliding-window transformer plus reconstruction yields transferable cross-domain graph representations without fine-tuning.

  4. Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding

    cs.LG 2026-02 conditional novelty 5.0 of 10

    GPH^2 pre-trains one expert per graph on edge-dropped or meta-path views and fuses frozen experts with class-wise attention, outperforming type-specific graph pre-training baselines.

Pith tools