Pith. sign in

REVIEW 1 cited by

Label-GCN: An Effective Method for Adding Label Propagation to 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 2104.02153 v1 pith:ZVVYRBU6 submitted 2021-04-05 cs.LG

classification cs.LG
keywords labelconvolutionalduringgraphphaseusedacrossadding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We show that a modification of the first layer of a Graph Convolutional Network (GCN) can be used to effectively propagate label information across neighbor nodes, for binary and multi-class classification problems. This is done by selectively eliminating self-loops for the label features during the training phase of a GCN. The GCN architecture is otherwise unchanged, without any extra hyper-parameters, and can be used in both a transductive and inductive setting. We show through several experiments that, depending on how many labels are available during the inference phase, this strategy can lead to a substantial improvement in the model performance compared to a standard GCN approach, including with imbalanced datasets.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Neighbor-Sampling Based Momentum Stochastic Methods for Training Graph Neural Networks

    math.OC 2025-08 unverdicted novelty 5.0 of 10

    The paper creates Adam-style optimizers that combine neighbor sampling and control variates for graph neural networks, with optimal convergence rates and better node-classification performance than control-variate SGD.

Pith tools