pith. sign in

arxiv: 2406.02953 · v1 · pith:3IA7WSDXnew · submitted 2024-06-05 · 💻 cs.LG

GraphAlign: Pretraining One Graph Neural Network on Multiple Graphs via Feature Alignment

classification 💻 cs.LG
keywords graphsgraphfeaturegraphalignacrossalignmentexistinglearning
0
0 comments X
read the original abstract

Graph self-supervised learning (SSL) holds considerable promise for mining and learning with graph-structured data. Yet, a significant challenge in graph SSL lies in the feature discrepancy among graphs across different domains. In this work, we aim to pretrain one graph neural network (GNN) on a varied collection of graphs endowed with rich node features and subsequently apply the pretrained GNN to unseen graphs. We present a general GraphAlign method that can be seamlessly integrated into the existing graph SSL framework. To align feature distributions across disparate graphs, GraphAlign designs alignment strategies of feature encoding, normalization, alongside a mixture-of-feature-expert module. Extensive experiments show that GraphAlign empowers existing graph SSL frameworks to pretrain a unified and powerful GNN across multiple graphs, showcasing performance superiority on both in-domain and out-of-domain graphs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory

    cs.AI 2026-05 unverdicted novelty 6.0

    SAGE is a self-evolving agentic graph-memory engine that dynamically constructs and refines structured memory graphs via writer-reader feedback, yielding performance gains on multi-hop QA, open-domain retrieval, and l...

  2. Unified Graph Prompt Learning via Low-Rank Graph Message Prompting

    cs.LG 2026-04 unverdicted novelty 5.0

    LR-GMP unifies graph prompting via a low-rank Graph Message Prompt paradigm to achieve better generalization than component-specific methods.