GTAlign is proposed, a surprisingly simple yet effective Graph-to-Table Alignment framework for text-free Graph Foundation Model, and a community-guided continual pre-training, where pseudo-labels derived from graph community are used to construct few-shot prediction episodes.
Abstract
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. However, these methods often face a fundamental dilemma between training with limited data and a heavy reliance on textual attributes. Tabular foundation models (TFMs) offer a potential alternative, as node features and representations can be naturally organized in a tabular form. However, how to enable TFMs to effectively capture structural information of graphs remains largely unexplored. The key challenge is to learn a graph-to-table alignment mechanism that enables graph structural understanding for TFMs. To address this, we propose GTAlign, a surprisingly simple yet effective Graph-to-Table Alignment framework for text-free Graph Foundation Model. Specifically, we first pretrain a graph encoder that maps diverse graphs into a unified latent space to capture domain-agnostic graph representations. To further bridge the gap between graph topology and the tabular representation space, we propose community-guided continual pre-training, where pseudo-labels derived from graph community are used to construct few-shot prediction episodes. Lastly, we adapt the graph encoder for an unseen target domain and perform in-context inference. Extensive experiments on five benchmark datasets demonstrate that GTAlign significantly outperforms state-of-the-art baselines on both node and graph classification, offering a simple, effective, and text-free GFM model. Code will be released upon acceptance.
A Propagation-aware Graph Foundation Model (ProGFM), which regards the propagation relationships between edges and feature dimensions as transferable knowledge units, and exhibits superior generalization performance compared with existing methods.
Yi Wang, Jitao Zhao, Di Jin et al.· arXiv.org· 0 citations
SliGFM is proposed, a graph foundation model built upon topology-aware sliding-window feature encoding and generative reconstruction that enables a smoothness-aware transformer to capture transferable relational patterns among feature tokens within each node, while the generative reconstruction objective encourages pre...
A multi-semantic basis representation learning paradigm that models each multi-label node as an adaptive composition of semantic bases, thereby enabling flexible representational capacity for modeling multiple semantics.
Dong-Xiao He, Jia-Yu Zhang, Ji-Tao Zhao et al.· 0 citations
Click-through rate (CTR) prediction is a critical task in personalized recommender systems. Existing methods that align collaborative information from conventional CTR models with semantic information from pre-trained language models (PLMs) have demonstrated superior performance compared to approaches relying on a sing...
Zhongzheng Wu, Yating Ren, Shuocheng Li et al.· Proceedings of the 32nd ACM...· 0 citations
CHARM is proposed, a multimodal graph foundation model with hierarchical context modeling for zero-shot transfer that replaces isolated raw nodes with hierarchical graph contexts that capture multimodal semantics and cross-modal relations.
Ankang Yang, Ji-Tao Zhao, Di Jin et al.· arXiv.org· 0 citations
Chimaera integrates mixture-of-experts with graph foundation models (GFM) and integrates different GFM architectures, such as graph prompts and linear GNN models, to extend existing linear GNNs to support link-level and graph-level tasks in addition to node-level tasks.
John P. Frank, David Richerby, A. Scherp· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.