REVIEW 8 cited by
Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights
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
Given the ubiquity of graph data and its applications in diverse domains, building a Graph Foundation Model (GFM) that can work well across different graphs and tasks with a unified backbone has recently garnered significant interests. A major obstacle to achieving this goal stems from the fact that graphs from different domains often exhibit diverse node features. Inspired by multi-modal models that align different modalities with natural language, the text has recently been adopted to provide a unified feature space for diverse graphs. Despite the great potential of these text-space GFMs, current research in this field is hampered by two problems. First, the absence of a comprehensive benchmark with unified problem settings hinders a clear understanding of the comparative effectiveness and practical value of different text-space GFMs. Second, there is a lack of sufficient datasets to thoroughly explore the methods' full potential and verify their effectiveness across diverse settings. To address these issues, we conduct a comprehensive benchmark providing novel text-space datasets and comprehensive evaluation under unified problem settings. Empirical results provide new insights and inspire future research directions. Our code and data are publicly available from \url{https://github.com/CurryTang/TSGFM}.
Forward citations
Cited by 8 Pith papers
-
GABench: A Comprehensive Benchmark for Evaluating LLM Agents on Graph Analysis Tasks
GABench provides the first agentic graph-analysis benchmark with 10,400 executable tasks, and finds existing LLM agents succeed on under 40% of complex graph tasks.
-
Attacking Graph Foundation Models Through Their Shared Representation
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.
-
Towards Text-free Graph Foundation Models: Rethinking Multi-Domain Graph Contrastive Learning
MDGCL pre-trains graph encoders on multiple domains using same-domain discrimination and a downstream domain-attention mechanism, outperforming existing text-free graph foundation models.
-
H$^2$GFM: Towards unifying Homogeneity and Heterogeneity on Text-Attributed Graphs
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.
-
OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation
OpenRTAG is a benchmark that organizes text-attributed-graph data-quality issues into a 3x3 taxonomy (text/structure/label by sparsity/noise/imbalance) and evaluates model robustness across nine datasets and three tasks.
-
GSTBench: A Benchmark Study on the Transferability of Graph Self-Supervised Learning
GSTBench finds that masked feature reconstruction (GraphMAE) is the only one of five graph self-supervised pretraining objectives that consistently transfers across eight datasets, while contrastive methods often perf...
-
PyG 2.0: Scalable Learning on Real World Graphs
PyG 2.0 is presented as a modular, scalable graph-learning framework with heterogeneous and temporal graph support, compilation-based speedups, and explainability.
-
Homophily Enhanced Graph Domain Adaptation
Graph domain adaptation fails more when source and target graphs have different local homophily profiles, and the proposed HGDA filters and aligns homophily, heterophily, and attribute signals to improve cross-graph n...
Discussion (0). Sign in to comment.