REVIEW 2 cited by
Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Nowadays, Graph Neural Networks (GNNs) following the Message Passing paradigm become the dominant way to learn on graphic data. Models in this paradigm have to spend extra space to look up adjacent nodes with adjacency matrices and extra time to aggregate multiple messages from adjacent nodes. To address this issue, we develop a method called LinkDist that distils self-knowledge from connected node pairs into a Multi-Layer Perceptron (MLP) without the need to aggregate messages. Experiment with 8 real-world datasets shows the MLP derived from LinkDist can predict the label of a node without knowing its adjacencies but achieve comparable accuracy against GNNs in the contexts of semi- and full-supervised node classification. Moreover, LinkDist benefits from its Non-Message Passing paradigm that we can also distil self-knowledge from arbitrarily sampled node pairs in a contrastive way to further boost the performance of LinkDist.
Forward citations
Cited by 2 Pith papers
-
Graph Neural Networks Need Cluster-Normalize-Activate Modules
A Cluster-Normalize-Activate module replaces plain activations in GNNs, limiting oversmoothing and improving accuracy with fewer parameters.
-
Revisiting the Necessity of Graph Learning and Common Graph Benchmarks
Tuned feature-only MLPs nearly match graph neural networks on five common graph benchmarks, suggesting those benchmarks measure feature quality more than graph learning.
Discussion (0). Continue with ORCID to comment.