Pith. sign in

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

arxiv 2112.11628 v4 pith:N2LBNLVP submitted 2021-12-22 cs.LG

classification cs.LG
keywords performancedeepdegradationgcnsover-smoothingconvolutionalgradientgraph
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Exploring and Improving Initialization for Deep Graph Neural Networks: A Signal Propagation Perspective

    cs.LG 2025-06 conditional novelty 6.0 of 10

    SPoGInit stabilizes forward, backward, and embedding-variation signal propagation in deep graph convolutional networks, mitigating the performance degradation that normally comes with depth.

  2. AGMixup: Adaptive Graph Mixup for Semi-supervised Node Classification

    cs.LG 2024-12 conditional novelty 6.0 of 10

    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.

Pith tools