Skip to content
Preprint

Towards Multi-Label Graph Foundation Models: from Single-Vector Representation Learning to Multi-Semantic Basis Learning

Jul 2026 · 0 citations · 26 references
Computer Science

TL;DR

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.

Abstract

Multi-label node classification is an important yet challenging task in graph learning, where nodes exhibit multiple semantics simultaneously. Existing methods for multi-label node classification can effectively model multiple labels, while only considering in-domain scenarios where the model needs to be trained and tested within the same graph domain, resulting in limited cross-domain generalization. Recently, Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable graph representations across diverse graph domains and downstream tasks. However, existing GFMs are built upon single-label assumption, where all nodes are arbitrarily regarded as containing only one class of semantic and embedded into a single representation. For multi-label nodes, such a representation essentially approximates multiple semantics with a single point in the representation space, inevitably leading to semantic entanglement and making simultaneous discrimination of multiple labels difficult. To address these limitations, we propose a Multi-Semantic Basis Graph Foundation Model (MSB-GFM), a framework for cross-domain multi-label node classification. Specifically, we introduce 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. Furthermore, we develop a semantic-structure dual-channel architecture with domain adversarial training for effective cross-domain knowledge transfer. Extensive experiments demonstrate the effectiveness of our model.

View source

Similar papers

Conference Open access Sep 2026

Multi-Semantic Aware Self-Supervised Learning for Multi-Label Node Classification

A multi-pseudo-label decomposition mechanism is proposed, enabling adaptive learning of multiple semantics within nodes without annotations, in a bold attempt to extend graph self-supervised learning to multi-label graphs.

Jia-Yu Zhang, Ji-Tao Zhao, Dong-Xiao He et al. · 0 citations
#machine learning Preprint Sep 2026

HyperLabel: Multi-Label Classification via Hypergraph-Based Label Correlation Modeling

This work proposes HyperLabel, an encoder-decoder framework that explicitly models label dependencies through hypergraph neural networks, and proposes a unified cross-modal learning approach where HGNN+ performs bidirectional message passing to integrate feature information with label structure, and a shared cross-atte...

Pei-Yu Zhang, Heng Ping, Nikos Kanakaris et al. · 0 citations
#machine learning Preprint Sep 2026

The Universal Classifier for Graph Learning

While foundation models have revolutionized natural language processing and computer vision by leveraging universal vocabularies, Graph Machine Learning (GML) remains fractured due to the absence of a unified feature and structural representation across diverse domains. Existing works claiming to be Graph Foundation Mo...

Ben Finkelshtein, André Linhares, Petar Veličković et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Towards One-for-All Foundation Model for Attributed Graph Clustering

Attributed graph clustering aims to discover node groups by jointly exploiting node attributes and graph topology, yet its unsupervised nature makes model selection and adaptation inherently difficult. Existing methods typically train and tune a separate model for each input graph, leading to costly and fragile pipelin...

Yunhui Liu, Xu-Dong Jin, Kang Zhang et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.