REVIEW 21 cited by
Graph Foundation Models: Concepts, Opportunities and Challenges
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
read the original abstract
Foundation models have emerged as critical components in a variety of artificial intelligence applications, and showcase significant success in natural language processing and several other domains. Meanwhile, the field of graph machine learning is witnessing a paradigm transition from shallow methods to more sophisticated deep learning approaches. The capabilities of foundation models in generalization and adaptation motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm. This paradigm envisions models that are pre-trained on extensive graph data and can be adapted for various graph tasks. Despite this burgeoning interest, there is a noticeable lack of clear definitions and systematic analyses pertaining to this new domain. To this end, this article introduces the concept of Graph Foundation Models (GFMs), and offers an exhaustive explanation of their key characteristics and underlying technologies. We proceed to classify the existing work related to GFMs into three distinct categories, based on their dependence on graph neural networks and large language models. In addition to providing a thorough review of the current state of GFMs, this article also outlooks potential avenues for future research in this rapidly evolving domain.
Forward citations
Cited by 21 Pith papers
-
GraphARC: A Comprehensive Benchmark for Graph-Based Abstract Reasoning
GraphARC is a scalable benchmark for few-shot graph transformation learning that exposes a comprehension-execution gap in language models on abstract reasoning tasks.
-
Empowering Heterogeneous Graph Foundation Models via Decoupled Relation Alignment
DRSA provides a plug-and-play alignment framework that decouples features and relations to prevent type collapse and relation confusion in heterogeneous graph foundation models.
-
SkillGraph: Graph Foundation Priors for LLM Agent Tool Sequence Recommendation
SkillGraph builds a reusable execution-transition graph prior from LLM trajectories and applies it via hybrid retrieval plus learned reranking to raise tool-sequence quality on ToolBench and API-Bank benchmarks.
-
PhyCheck: Fine-Grained Evidence-Grounded Dataset for Physical Law Understanding in Video-LLMs
PhyCheck is a 69,825-pair video QA benchmark that tests and improves Video-LLMs' ability to judge whether events obey physical laws, with fine-grained evidence questions and a context-sensitivity pilot.
-
Beyond Feature and Structure Alignment: Learning Transferable Propagation Knowledge for Graph Foundation Models
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.
-
TRACE: A Temporal Conditional Estimation for Multimodal Time Series Foundation Models
TRACE proposes a temporal conditional estimation paradigm for multimodal time series foundation models that infers incomplete target modalities from auxiliary ones, outperforming prior fusion methods on clinical and s...
-
Semi-Supervised Text-Attributed Graph Distillation
STAD distills large text-attributed graphs into tiny human-readable graphs that match or beat full-graph semi-supervised node classification.
-
S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs
S2Aligner decouples semantic and structural components in LLM-as-Aligner pre-training for sparse TAGs and uses structure-oriented reconstruction plus domain risk balancing to improve transferability and reduce general...
-
A Unified Graph Language Model for Multi-Domain Multi-Task Graph Alignment Instruction Tuning
UniGraphLM uses a multi-domain multi-task GNN encoder and adaptive alignment to create unified graph tokens for LLMs across diverse domains and tasks.
-
SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory
SAGE is a self-evolving agentic graph-memory engine that dynamically constructs and refines structured memory graphs via writer-reader feedback, yielding performance gains on multi-hop QA, open-domain retrieval, and l...
-
What Makes Graph Unified? Principles and Generative Sliding-Window Transformer for Graph Foundation Models
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.
-
MEGA-CL: A Molecular Foundation Model for Generalizable ADMET Prediction through Graph External Attention and Contrastive Learning
A contrastive GNN with external attention, pre-trained on ~100M molecules, improves multi-task ADMET prediction and shows prospective wet-lab agreement on three compounds.
-
A Weisfeiler-Leman Characterization of Global-Attention Graph Transformers for Mixed-Integer Linear Programs
Global-attention MILP graph encoders built from symmetric multiset aggregation are 1-WL-bounded: 1-WL-equivalent MILP graphs always get identical embeddings.
-
Node-to-Neighborhood Semantic Consistency: Text-Topology Alignment for TAGs Anomaly Detection
N2NSC framework detects anomalies in text-attributed graphs by enforcing node-to-neighborhood semantic consistency via two complementary fusion paths that align textual semantics with topology.
-
Handling Feature Heterogeneity with Learnable Graph Patches
Learnable graph patches enable domain-agnostic pre-training of graph models by decomposing heterogeneous graphs into transferable semantic units via patch encoders and aggregators.
-
A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation
SPG is a graph foundation model using spectral decomposition via Chebyshev filters and Gromov-Wasserstein prototypes for improved cross-graph transferability.
-
S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs
S2Aligner decouples semantic and structural components in LLM-based graph-text alignment, adds structure-oriented reconstruction with consistency control, and uses sparsity-aware risk balancing to reduce cross-domain ...
-
Agentic AIs Are the Missing Paradigm for Out-of-Distribution Generalization in Foundation Models
Agentic AI systems are required to overcome the parameter coverage ceiling that prevents foundation models from handling certain out-of-distribution cases.
-
Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding
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.
-
Retrieval-Augmented Generation with Graphs (GraphRAG)
A survey proposing a holistic GraphRAG framework with components including query processor, retriever, organizer, generator, and data source, plus domain-tailored reviews, challenges, and future directions.
-
RankGraph: Unified Heterogeneous Graph Learning for Cross-Domain Recommendation
RankGraph combines RGCN-style message passing, contrastive learning, and graph-token injection into foundation-model recommenders, reporting small online CTR and CVR gains.
Discussion (0). Sign in to comment.