REVIEW 4 cited by
Bag of Tricks for Node Classification with Graph Neural Networks
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
Signed reviews
read the original abstract
Over the past few years, graph neural networks (GNN) and label propagation-based methods have made significant progress in addressing node classification tasks on graphs. However, in addition to their reliance on elaborate architectures and algorithms, there are several key technical details that are frequently overlooked, and yet nonetheless can play a vital role in achieving satisfactory performance. In this paper, we first summarize a series of existing tricks-of-the-trade, and then propose several new ones related to label usage, loss function formulation, and model design that can significantly improve various GNN architectures. We empirically evaluate their impact on final node classification accuracy by conducting ablation studies and demonstrate consistently-improved performance, often to an extent that outweighs the gains from more dramatic changes in the underlying GNN architecture. Notably, many of the top-ranked models on the Open Graph Benchmark (OGB) leaderboard and KDDCUP 2021 Large-Scale Challenge MAG240M-LSC benefit from these techniques we initiated.
Forward citations
Cited by 4 Pith papers
-
Parameter-Free Encoders Remain Viable for RDB Foundation Models
Trainable RDB encoders cannot robustly exploit neighborhood labels as fixed foundation-model features or feature-importance signals, so simple parameter-free encoders stay near-SOTA.
-
ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions
A reparameterized masked diffusion model with variational EM gives scalable structured node classification, matching or beating GNN, label propagation, and continuous diffusion baselines.
-
Exploring and Improving Initialization for Deep Graph Neural Networks: A Signal Propagation Perspective
SPoGInit stabilizes forward, backward, and embedding-variation signal propagation in deep graph convolutional networks, mitigating the performance degradation that normally comes with depth.
-
SA-GNAS: Seed Architecture Expansion for Efficient Large-scale Graph Neural Architecture Search
Seed-architecture expansion via Kendall-tau subgraph matching and entropy-guided node splitting scales graph neural architecture search to billion-edge graphs in about 8 GPU hours.
Discussion (0). Continue with ORCID to comment.