mlsanityData to 14 Oct 2026

Mutual Teaching for Graph Convolutional Networks

arXiv 2009.00952 ↗First posted 2 Sep 2020cs.LG cs.CV stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Graph convolutional networks produce good predictions of unlabeled samples due to its transductive label propagation. Since samples have different predicted confidences, we take high-confidence predictions as pseudo labels to expand the label set so that more samples are selected for updating models. We propose a new training method named as mutual teaching, i.e., we train dual models and let them teach each other during each batch. First, each network feeds forward all samples and selects samples with high-confidence predictions. Second, each model is updated by samples selected by its peer network. We view the high-confidence predictions as useful knowledge, and the useful knowledge of one network teaches the peer network with model updating in each batch. In mutual teaching, the pseudo-label set of a network is from its peer network. Since we use the new strategy of network training, performance improves significantly. Extensive experimental results demonstrate that our method achieves superior performance over state-of-the-art methods under very low label rates.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 4; 2024: 1; 2025: 1.

8 papers.