A Collective Learning Framework to Boost GNN Expressiveness
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) have recently been used for node and graph classification tasks with great success, but GNNs model dependencies among the attributes of nearby neighboring nodes rather than dependencies among observed node labels. In this work, we consider the task of inductive node classification using GNNs in supervised and semi-supervised settings, with the goal of incorporating label dependencies. Because current GNNs are not universal (i.e., most-expressive) graph representations, we propose a general collective learning approach to increase the representation power of any existing GNN. Our framework combines ideas from collective classification with self-supervised learning, and uses a Monte Carlo approach to sampling embeddings for inductive learning across graphs. We evaluate performance on five real-world network datasets and demonstrate consistent, significant improvement in node classification accuracy, for a variety of state-of-the-art GNNs.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.
- 2023Vertical Federated Learning: Taxonomies, Threats, and Prospectscited by 8
- 2021Set Twister for Single-hop Node Classificationcited by 0
- 2023Vertical Federated Learning: Taxonomies, Threats, and Prospects3 Feb 2023
- 2021Set Twister for Single-hop Node Classification17 Dec 2021