{"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/multi-task-self-distillation-for-graph-based","title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","arxiv_id":"2112.01174","date":"2021-12-02","proceeding":null,"authors":["Yating Ren","Junzhong Ji","Lingfeng Niu","Minglong Lei"],"abstract":"Graph convolutional networks have made great progress in graph-based semi-supervised learning. Existing methods mainly assume that nodes connected by graph edges are prone to have similar attributes and labels, so that the features smoothed by local graph structures can reveal the class similarities. However, there often exist mismatches between graph structures and labels in many real-world scenarios, where the structures may propagate misleading features or labels that eventually affect the model performance. In this paper, we propose a multi-task self-distillation framework that injects self-supervised learning and self-distillation into graph convolutional networks to separately address the mismatch problem from the structure side and the label side. First, we formulate a self-supervision pipeline based on pre-text tasks to capture different levels of similarities in graphs. The feature extraction process is encouraged to capture more complex proximity by jointly optimizing the pre-text task and the target task. Consequently, the local feature aggregations are improved from the structure side. Second, self-distillation uses soft labels of the model itself as additional supervision, which has similar effects as label smoothing. The knowledge from the classification pipeline and the self-supervision pipeline is collectively distilled to improve the generalization ability of the model from the label side. Experiment results show that the proposed method obtains remarkable performance gains under several classic graph convolutional architectures.","url_abs":"https://arxiv.org/abs/2112.01174v3","url_pdf":"https://arxiv.org/pdf/2112.01174v3.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":[],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-amz-computers-fixed-20","task":"Node Classification","dataset":"AMZ Computers: fixed 20 node per class","model":"SDSS-GCN","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"84.86"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-fixed-20-node","task":"Node Classification","dataset":"Citeseer: fixed 20 node per class","model":"SDSS-GAT","rank_in_archive_order":1,"of":2,"metrics":{"Accuracy":"76.35"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-fixed-20-nodes","task":"Node Classification","dataset":"Cora: fixed 20 nodes per class","model":"SDSS-GCN","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"86.00"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-fixed-20-node","task":"Node Classification","dataset":"Pubmed: fixed 20 node per class","model":"SDSS-APPNP","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"82.72"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2112.01174","atlas_url":"https://app.syntology.ai/?focus=2112.01174","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2112.01174"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2112.01174\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2112.01174"},"call":"get_concepts_for_paper(arxiv_id=\"2112.01174\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"40ffecac98a8cc2702564ec3715ff692426e466085995b93a35b21fb7f6e6dee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}