negMIX: Negative Mixup for OOD Generalization in Open-Set Node Classification

March 21, 2026 ยท Grace Period ยท ๐Ÿ› In Proceedings of the ACM Web Conference (WWW 26), 2026

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Junwei Gong, Xiao Shen, Zhihao Chen, Shirui Pan, Xiao Wang, Xi Zhou arXiv ID 2603.20798 Category cs.SI: Social & Info Networks Citations 0 Venue In Proceedings of the ACM Web Conference (WWW 26), 2026
Abstract
Open-set node classification (OSNC) allows unlabeled test data to contain novel classes previously unseen in the labeled data. The goal is to classify in-distribution (ID) nodes into corresponding known classes and reject out-of-distribution (OOD) nodes as unknown class. Despite recent notable progress in OSNC, two challenges remain less explored, i.e., how to enhance generalization to OOD nodes, and promote intra-class compactness and inter-class separability. To tackle such challenges, we propose a novel Negative Mixup with Cross-Layer Graph Contrastive Learning (negMIX) model. Firstly, we devise a novel negative Mixup method purposefully crafted for the open-set scenario with theoretical justification, to enhance the model's generalization to OOD nodes and yield clearer ID/OOD boundary. Additionally, a unique cross-layer graph contrastive learning module is developed to maximize the prototypical mutual information between the same class nodes across different topological distance neighborhoods, thereby facilitating intra-class compactness and inter-class separability. Extensive experiments validate significant outperformance of the proposed negMIX over state-of-the-art methods in various scenarios and settings.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Social & Info Networks