arXiv Machine Learning By Ankang Yang, Jitao Zhao, Dongxiao He, Liang Yang, Di Jin, Weixiong Zhang

A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation

Read the original on arXiv Machine Learning →

arXiv:2606. 03315v1 Announce Type: new Abstract: Graph foundation models aim to learn transferable knowledge from diverse graphs for generalization to unseen graphs and tasks.

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
arXiv Machine Learning
Jun 16

Graph Learning Should Move Beyond Restrictive Views of Spectral and Message-Passing GNNs

arXiv:2602. 10031v2 Announce Type: replace Abstract: Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral GNNs, reflecting two largely separate research traditions in machine learning and signal processing.

By Antonis Vasileiou, Juan Cervino, Pascal Frossard, Charilaos I. Kanatsoulis, Christopher Morris, Michael T. Schaub, Pierre Vandergheynst, Zhiyang Wang, Guy Wolf, Ron Levie