2025· Neural Information Processing Systems· pp. 161367-161390· 0 citations· 55 references
Computer Science
TL;DR
A unified and efficient Graph Multi-View (GMV) learning framework that integrates multi-view learning into GNNs to enhance robustness and efficiency and surpasses other augmentation and ensemble techniques for GNNs and Graph Transformers across various graph classification scenarios.
Abstract
Graph Neural Networks (GNNs) are pivotal in graph classification but often struggle with generalization and overfitting. We introduce a unified and efficient Graph Multi-View (GMV) learning framework that integrates multi-view learning into GNNs to enhance robustness and efficiency. Leveraging the lottery ticket hypothesis, GMV activates diverse sub-networks within a single GNN through a novel training pipeline, which includes mixed-view generation, and multi-view decomposition and learning. This approach simultaneously broadens “views” from the data, model, and optimization perspectives during training to enhance the generalization capabilities of GNNs. During inference, GMV only incorporates additional prediction heads into standard GNNs, thereby achieving multi-view learning at minimal cost. Our experiments demonstrate that GMV surpasses other augmentation and ensemble techniques for GNNs and Graph Transformers across various graph classification scenarios. The open source code can be found in https://github.com/smurf-1119/GMV.
This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.
Wan Tang, Lu Bai, Li-Xin Cui et al.· Proceedings of the Thirty-Fi...· 0 citations
Multi-view representation learning, aiming to extract discriminative patterns from heterogeneous data sources, has attracted increasing attention in recent years. A central challenge in multi-view data fusion lies in determining the appropriate weight and importance of each view in a principled manner. While graph-base...
Na Song, Xin Wang, Zhi-Cai Zhang et al.· Big Data and Cognitive Compu...· 0 citations
Graph Foundation Models (GFMs) have recently emerged as a promising direction for learning reusable knowledge from graph-structured data. Unlike conventional graph neural networks (GNNs), which are usually trained for a specific graph and task, GFMs aim to transfer graph representations across graphs, tasks, and featur...
Alexander Zhou, Hao-Yang Li, Lei Chen· Proceedings of the VLDB Endo...· 0 citations
A combined HGT-based framework incorporating contrastive representation learning and deep clustering with multi-round training via pseudo-labels is presented, enabling the model to better deal with label scarcity, heterogeneous dependencies, and overlapping semantics in practical, complex, attributed networks.
Hamza Haddad, Hicham Attariuas, A. Younes· Edelweiss Applied Science an...· 0 citations
A Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of-Distribution detection (termed HGOOD), which constructs two branches to hierarchically mine graph compact semantics in a comprehensive manner and introduces a cross-branch prototype contrast that aligns the captured graph patterns with their cr...
Xuan-Ting Fan, Chen-Yu Wang, Yue-Yue Gao et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.