arXiv:2609.37057v1 Announce Type: new Abstract: Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeat...
arXiv:2509. 21489v4 Announce Type: replace Abstract: Graph foundation models face several fundamental challenges including transferability across diverse domains and data scarcity, which calls into question the very feasibility of creating such models.
arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).
arXiv:2605.10247v2 Announce Type: replace Abstract: Applying Large Language Models (LLMs) to graph-structured data usually involves multi-step pipelines in which textual node attributes are compresse...
arXiv:2605.14907v2 Announce Type: replace Abstract: Knowledge graph (KG) foundation models aim to generalize to graphs with unseen entities and relations by learning transferable relational structure...
arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
arXiv:2607. 11374v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains.
arXiv:2609.39673v1 Announce Type: new Abstract: Can a pretrained graph model replace training and tuning a separate predictor for each dataset? Answering this requires evaluating prediction quality a...
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains. Recent advancements in GFMs have been largely dominated by two paradigms: Graph Neural Network and Large Language Model (LLM) based methods.
The paper introduces GraphMemory, a lightweight graph-based memory system designed to improve token efficiency in test-time continual learning for large language models. By retrieving only relevant subgraphs for each query, GraphMemory keeps the amount of retrieved memory constant as more examples are processed, avoiding the token cost and performance degradation of traditional shared-context approaches. Experiments demonstrate that GraphMemory achieves competitive downstream performance while using roughly 81‑85% fewer memory‑construction tokens than baseline methods.
The paper introduces PromptGFM, a Graph Foundation Model designed for text‑attributed graphs (TAGs). It integrates Large Language Models (LLMs) and Graph Neural Networks (GNNs) through a Graph Understanding Module that prompts LLMs to emulate GNN workflows, and a Graph Inference Module that creates a language‑based graph vocabulary for better alignment and scalability. Experiments show PromptGFM outperforms existing methods and transfers effectively across various graphs and tasks.