Fast and featureless node representation learning with partial pairwise supervision

Sujan Chakraborty

doi:10.1016/j.neunet.2026.109516

Return

Fast and featureless node representation learning with partial pairwise supervision

2026-08-16

PRE

Sujan Chakraborty

Saptarshi Bej *

DOI：10.1016/j.neunet.2026.109516

Original

Original request for help

Save

Abstract

En 中文

We introduce Contrastive FUSE, a fast and unified framework for scalable node representation learning in graphs with partially available pairwise node labels and no available node features. Unlike existing methods, we directly optimize a spectral contrastive objective that integrates community-aware structural signals with signed pairwise constraints. To support large-scale training, we replace the expensive modularity gradient with a lightweight approximation, which preserves the structure-seeking behavior of modularity while reducing the computational cost significantly. This yields an efficient optimization scheme with a natural gradient decomposition and adaptive learning-rate scaling, enabling fast iterative updates even on million-edge graphs. Extensive experiments on benchmark citation networks, large co-purchase graphs, and OGB datasets show that Contrastive FUSE achieves competitive or superior contrastive classification performance without relying on node features, while offering substantial runtime gains over existing baselines. These results highlight the effectiveness of coupling modularity-inspired structural learning with contrastive supervision for efficient and scalable contrastive node representation learning.

Keywords:

Contrastive learning

Node representation learning

Modularity optimization

Pairwise supervision

Network embedding