arXiv Machine Learning By Omer Yom Tov, Avigdor Gal

Neural Message Passing on Structural Interaction Graphs for Fully-Inductive Graph Neural Networks

Read the original on arXiv Machine Learning →

arXiv:2608. 08567v1 Announce Type: new Abstract: A central obstacle in building graph foundation models is the input heterogeneity in terms of feature space dimensionality, semantics, and structure.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jul 30

What Makes Graph Unified? Principles and Generative Sliding-Window Transformer for Graph Foundation Models

Graph Foundation Models (GFMs) have recently emerged as a promising paradigm for general-purpose graph learning, aiming to learn reusable knowledge that generalizes across diverse graph domains and downstream tasks, reducing the need for specific model development. Achieving this goal requires reconciling the substantial heterogeneity in node features, graph structures, and semantic information across domains.

arXiv Machine Learning
Jul 31

What Makes Graph Unified? Principles and Generative Sliding-Window Transformer for Graph Foundation Models

arXiv:2607. 27966v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have recently emerged as a promising paradigm for general-purpose graph learning, aiming to learn reusable knowledge that generalizes across diverse graph domains and downstream tasks, reducing the need for specific model development.

By Dongxiao He, Siqi Liu, Jitao Zhao, Yawen Li, Yi Wang, Di Jin
arXiv AI
Jun 17

Handling Feature Heterogeneity with Learnable Graph Patches

arXiv:2606. 17667v1 Announce Type: cross Abstract: In recent years, the rapid development of foundation models and graph pre-training technologies has spurred increasing interest in constructing a universal pre-trained graph model or Graph Foundation Model (GFM).

By Yifei Sun, Yang Yang, Xiao Feng, Zijun Wang, Haoyang Zhong, Chunping Wang, Lei Chen