REVIEW 3 cited by
LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model
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
Graph foundation models (GFMs) have recently gained significant attention. However, the unique data processing and evaluation setups employed by different studies hinder a deeper understanding of their progress. Additionally, current research tends to focus on specific subsets of graph learning tasks, such as structural tasks, node-level tasks, or classification tasks. As a result, they often incorporate specialized modules tailored to particular task types, losing their applicability to other graph learning tasks and contradicting the original intent of foundation models to be universal. Therefore, to enhance consistency, coverage, and diversity across domains, tasks, and research interests within the graph learning community in the evaluation of GFMs, we propose GFMBench-a systematic and comprehensive benchmark comprising 26 datasets. Moreover, we introduce LangGFM, a novel GFM that relies entirely on large language models. By revisiting and exploring the effective graph textualization principles, as well as repurposing successful techniques from graph augmentation and graph self-supervised learning within the language space, LangGFM achieves performance on par with or exceeding the state of the art across GFMBench, which can offer us new perspectives, experiences, and baselines to drive forward the evolution of GFMs.
Forward citations
Cited by 3 Pith papers
-
Rethinking Federated Graph Foundation Models: A Graph-Language Alignment-based Approach
FedGALA replaces vector-quantized federated graph foundation models with continuous graph-text contrastive alignment plus prompt tuning, claiming up to 14.37% gains over 22 baselines.
-
GRIP: In-Parameter Graph Reasoning through Fine-Tuning Large Language Models
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.
-
Masked Language Models are Good Heterogeneous Graph Generalizers
A masked language model fine-tuned on metapath-derived text and cloze-style task templates transfers across heterogeneous graph datasets better than HGNN and LLM baselines, though link prediction results are compromis...
Discussion (0). Continue with ORCID to comment.