{"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/adagcn-adaboosting-graph-convolutional","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","arxiv_id":"1908.05081","date":"2019-08-14","proceeding":"ICLR 2021 1","authors":["Ke Sun","Zhanxing Zhu","Zhouchen Lin"],"abstract":"The design of deep graph models still remains to be investigated and the crucial part is how to explore and exploit the knowledge from different hops of neighbors in an efficient way. In this paper, we propose a novel RNN-like deep graph neural network architecture by incorporating AdaBoost into the computation of network; and the proposed graph convolutional network called AdaGCN~(Adaboosting Graph Convolutional Network) has the ability to efficiently extract knowledge from high-order neighbors of current nodes and then integrates knowledge from different hops of neighbors into the network in an Adaboost way. Different from other graph neural networks that directly stack many graph convolution layers, AdaGCN shares the same base neural network architecture among all ``layers'' and is recursively optimized, which is similar to an RNN. Besides, We also theoretically established the connection between AdaGCN and existing graph convolutional methods, presenting the benefits of our proposal. Finally, extensive experiments demonstrate the consistent state-of-the-art prediction performance on graphs across different label rates and the computational advantage of our approach AdaGCN~\\footnote{Code is available at \\url{https://github.com/datake/AdaGCN}.}","url_abs":"https://arxiv.org/abs/1908.05081v3","url_pdf":"https://arxiv.org/pdf/1908.05081v3.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":"adagcn-adaboosting-graph-convolutional","repo_url":"https://github.com/datake/AdaGCN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-citeseer","task":"Node Classification","dataset":"Citeseer","model":"AdaGCN","rank_in_archive_order":14,"of":71,"metrics":{"Accuracy":"76.22 ± 0.20"},"uses_additional_data":true},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"AdaGCN","rank_in_archive_order":23,"of":73,"metrics":{"Accuracy":"85.46% ± 0.25%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-ms-academic","task":"Node Classification","dataset":"MS ACADEMIC","model":"APPNP (AdaGCN authors)","rank_in_archive_order":2,"of":3,"metrics":{"Accuracy":"92.98 ± 0.07"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-ms-academic","task":"Node Classification","dataset":"MS ACADEMIC","model":"AdaGCN","rank_in_archive_order":3,"of":3,"metrics":{"Accuracy":"92.87 ± 0.07"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"AdaGCN","rank_in_archive_order":37,"of":70,"metrics":{"Accuracy":"79.76 ± 0.27"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/1908.05081","atlas_url":"https://app.syntology.ai/?focus=1908.05081","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":"1908.05081"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1908.05081\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1908.05081"},"call":"get_concepts_for_paper(arxiv_id=\"1908.05081\")"}],"by_repo":[{"repo":"datake/AdaGCN","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":"696bcccbf2b1e74a4fbbfd5cd2cd7e783bfb86f093268cceaca5d04169ee3ab1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}