REVIEW 2 cited by
SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional 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
Graph Convolutional Networks (GCNs) suffer from performance degradation when models go deeper. However, earlier works only attributed the performance degeneration to over-smoothing. In this paper, we conduct theoretical and experimental analysis to explore the fundamental causes of performance degradation in deep GCNs: over-smoothing and gradient vanishing have a mutually reinforcing effect that causes the performance to deteriorate more quickly in deep GCNs. On the other hand, existing anti-over-smoothing methods all perform full convolutions up to the model depth. They could not well resist the exponential convergence of over-smoothing due to model depth increasing. In this work, we propose a simple yet effective plug-and-play module, Skipnode, to overcome the performance degradation of deep GCNs. It samples graph nodes in each convolutional layer to skip the convolution operation. In this way, both over-smoothing and gradient vanishing can be effectively suppressed since (1) not all nodes'features propagate through full layers and, (2) the gradient can be directly passed back through ``skipped'' nodes. We provide both theoretical analysis and empirical evaluation to demonstrate the efficacy of Skipnode and its superiority over SOTA baselines.
Forward citations
Cited by 2 Pith papers
-
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.
-
AGMixup: Adaptive Graph Mixup for Semi-supervised Node Classification
AGMixup mixes r-hop subgraphs through a virtual node and tunes the mixing ratio per pair, improving semi-supervised node classification accuracy over existing graph mixup baselines.
Discussion (0). Continue with ORCID to comment.