Pith. sign in

REVIEW 1 cited by

Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labels

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 1902.11038 v2 pith:YHPHHSA7 submitted 2019-02-28 cs.LG stat.ML

classification cs.LGstat.ML
keywords traininggraphlearningalgorithmmulti-stageself-supervisedconvolutionalgraphs
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) play a crucial role in graph learning tasks, however, learning graph embedding with few supervised signals is still a difficult problem. In this paper, we propose a novel training algorithm for Graph Convolutional Network, called Multi-Stage Self-Supervised(M3S) Training Algorithm, combined with self-supervised learning approach, focusing on improving the generalization performance of GCNs on graphs with few labeled nodes. Firstly, a Multi-Stage Training Framework is provided as the basis of M3S training method. Then we leverage DeepCluster technique, a popular form of self-supervised learning, and design corresponding aligning mechanism on the embedding space to refine the Multi-Stage Training Framework, resulting in M3S Training Algorithm. Finally, extensive experimental results verify the superior performance of our algorithm on graphs with few labeled nodes under different label rates compared with other state-of-the-art approaches.

Discussion (0). Continue with ORCID 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. PTCL: Pseudo-Label Temporal Curriculum Learning for Label-Limited Dynamic Graph

    cs.LG 2025-04 conditional novelty 5.0 of 10

    PTCL trains a dynamic graph classifier with only final-timestamp labels by using a variational EM loop and a temporal curriculum that weights pseudo-labels by closeness to the final label.

Pith tools