{"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/deeper-insights-into-graph-convolutional","title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","arxiv_id":"1801.07606","date":"2018-01-22","proceeding":null,"authors":["Qimai Li","Zhichao Han","Xiao-Ming Wu"],"abstract":"Many interesting problems in machine learning are being revisited with new\ndeep learning tools. For graph-based semisupervised learning, a recent\nimportant development is graph convolutional networks (GCNs), which nicely\nintegrate local vertex features and graph topology in the convolutional layers.\nAlthough the GCN model compares favorably with other state-of-the-art methods,\nits mechanisms are not clear and it still requires a considerable amount of\nlabeled data for validation and model selection. In this paper, we develop\ndeeper insights into the GCN model and address its fundamental limits. First,\nwe show that the graph convolution of the GCN model is actually a special form\nof Laplacian smoothing, which is the key reason why GCNs work, but it also\nbrings potential concerns of over-smoothing with many convolutional layers.\nSecond, to overcome the limits of the GCN model with shallow architectures, we\npropose both co-training and self-training approaches to train GCNs. Our\napproaches significantly improve GCNs in learning with very few labels, and\nexempt them from requiring additional labels for validation. Extensive\nexperiments on benchmarks have verified our theory and proposals.","url_abs":"http://arxiv.org/abs/1801.07606v1","url_pdf":"http://arxiv.org/pdf/1801.07606v1.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":"deeper-insights-into-graph-convolutional","repo_url":"https://github.com/liqimai/gcn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"model-selection","task_name":"Model Selection"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"gcn","method_name":"GCN"},{"method_slug":"graph-convolutional-networks","method_name":"Graph Convolutional Networks"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-brazil-air-traffic","task":"Node Classification","dataset":"Brazil Air-Traffic","model":"Union (Li et al., 2018)","rank_in_archive_order":4,"of":7,"metrics":{"Accuracy":"0.466"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-brazil-air-traffic","task":"Node Classification","dataset":"Brazil Air-Traffic","model":"Intersection (Li et al., 2018)","rank_in_archive_order":5,"of":7,"metrics":{"Accuracy":"0.459"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-europe-air-traffic","task":"Node Classification","dataset":"Europe Air-Traffic","model":"Intersection (Li et al., 2018)","rank_in_archive_order":4,"of":7,"metrics":{"Accuracy":"44.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-facebook","task":"Node Classification","dataset":"Facebook","model":"Intersection (Li et al., 2018)","rank_in_archive_order":6,"of":8,"metrics":{"Accuracy":"59.8"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-flickr","task":"Node Classification","dataset":"Flickr","model":"Intersection (Li et al., 2018)","rank_in_archive_order":5,"of":8,"metrics":{"Accuracy":"0.557"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-usa-air-traffic","task":"Node Classification","dataset":"USA Air-Traffic","model":"Union (Li et al., 2018)","rank_in_archive_order":5,"of":7,"metrics":{"Accuracy":"58.2"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-usa-air-traffic","task":"Node Classification","dataset":"USA Air-Traffic","model":"Intersection (Li et al., 2018)","rank_in_archive_order":6,"of":7,"metrics":{"Accuracy":"57.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-wiki-vote","task":"Node Classification","dataset":"Wiki-Vote","model":"Union (Li et al., 2018)","rank_in_archive_order":4,"of":6,"metrics":{"Accuracy":"46.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.07606","atlas_url":"https://app.syntology.ai/?focus=1801.07606","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":"1801.07606"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.07606\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.07606"},"call":"get_concepts_for_paper(arxiv_id=\"1801.07606\")"}],"by_repo":[{"repo":"liqimai/gcn","kind":"listed","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":"d7f10661c84345e9fb159456fd543e81b5514e83d93df06f15e9ddf45d69fba2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}