{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/mutual-teaching-for-graph-convolutional","title":"Mutual Teaching for Graph Convolutional Networks","arxiv_id":"2009.00952","date":"2020-09-02","proceeding":null,"authors":["Kun Zhan","Chaoxi Niu"],"abstract":"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.","url_abs":"https://arxiv.org/abs/2009.00952v1","url_pdf":"https://arxiv.org/pdf/2009.00952v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"mutual-teaching-for-graph-convolutional","repo_url":"https://github.com/kunzhan/MTGCN","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"pseudo-label","task_name":"Pseudo Label"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-citeseer-05","task":"Node Classification","dataset":"CiteSeer (0.5%)","model":"MT-GCN","rank_in_archive_order":1,"of":14,"metrics":{"Accuracy":"67.7%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-1","task":"Node Classification","dataset":"CiteSeer (1%)","model":"MT-GCN","rank_in_archive_order":3,"of":14,"metrics":{"Accuracy":"68.9%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"MT-GCN","rank_in_archive_order":63,"of":73,"metrics":{"Accuracy":"80.9%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-05","task":"Node Classification","dataset":"Cora (0.5%)","model":"MT-GCN","rank_in_archive_order":7,"of":15,"metrics":{"Accuracy":"66.9%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-1","task":"Node Classification","dataset":"Cora (1%)","model":"MT-GCN","rank_in_archive_order":7,"of":15,"metrics":{"Accuracy":"73.1%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-3","task":"Node Classification","dataset":"Cora (3%)","model":"MT-GCN","rank_in_archive_order":7,"of":15,"metrics":{"Accuracy":"78.5%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-003","task":"Node Classification","dataset":"PubMed (0.03%)","model":"MT-GCN","rank_in_archive_order":4,"of":14,"metrics":{"Accuracy":"65.5%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-005","task":"Node Classification","dataset":"PubMed (0.05%)","model":"MT-GCN","rank_in_archive_order":4,"of":14,"metrics":{"Accuracy":"69.5%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-01","task":"Node Classification","dataset":"PubMed (0.1%)","model":"MT-GCN","rank_in_archive_order":8,"of":14,"metrics":{"Accuracy":"73.1%"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"kunzhan/MTGCN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"705fb6f9f3af8abe76381682910fc1beba21ad46650f9afeac7e63e3272b95a7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}