{"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/cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","arxiv_id":"1905.07953","date":"2019-05-20","proceeding":"KDD 2019 5","authors":["Wei-Lin Chiang","Xuanqing Liu","Si Si","Yang Li","Samy Bengio","Cho-Jui Hsieh"],"abstract":"Graph convolutional network (GCN) has been successfully applied to many graph-based applications; however, training a large-scale GCN remains challenging. Current SGD-based algorithms suffer from either a high computational cost that exponentially grows with number of GCN layers, or a large space requirement for keeping the entire graph and the embedding of each node in memory. In this paper, we propose Cluster-GCN, a novel GCN algorithm that is suitable for SGD-based training by exploiting the graph clustering structure. Cluster-GCN works as the following: at each step, it samples a block of nodes that associate with a dense subgraph identified by a graph clustering algorithm, and restricts the neighborhood search within this subgraph. This simple but effective strategy leads to significantly improved memory and computational efficiency while being able to achieve comparable test accuracy with previous algorithms. To test the scalability of our algorithm, we create a new Amazon2M data with 2 million nodes and 61 million edges which is more than 5 times larger than the previous largest publicly available dataset (Reddit). For training a 3-layer GCN on this data, Cluster-GCN is faster than the previous state-of-the-art VR-GCN (1523 seconds vs 1961 seconds) and using much less memory (2.2GB vs 11.2GB). Furthermore, for training 4 layer GCN on this data, our algorithm can finish in around 36 minutes while all the existing GCN training algorithms fail to train due to the out-of-memory issue. Furthermore, Cluster-GCN allows us to train much deeper GCN without much time and memory overhead, which leads to improved prediction accuracy---using a 5-layer Cluster-GCN, we achieve state-of-the-art test F1 score 99.36 on the PPI dataset, while the previous best result was 98.71 by [16]. Our codes are publicly available at https://github.com/google-research/google-research/tree/master/cluster_gcn.","url_abs":"https://arxiv.org/abs/1905.07953v2","url_pdf":"https://arxiv.org/pdf/1905.07953v2.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":"cluster-gcn-an-efficient-algorithm-for","repo_url":"https://github.com/google-research/google-research","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"cluster-gcn-an-efficient-algorithm-for","repo_url":"https://github.com/NIRVANALAN/ClusterGCN_google-reseach","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"cluster-gcn-an-efficient-algorithm-for","repo_url":"https://github.com/benedekrozemberczki/ClusterGCN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"cluster-gcn-an-efficient-algorithm-for","repo_url":"https://github.com/qitianwu/nodeformer","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"cluster-gcn-an-efficient-algorithm-for","repo_url":"https://github.com/zhengjingwei/cluster_GCN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"cluster-gcn-an-efficient-algorithm-for","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/cluster_gcn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-property-prediction","task_name":"Node Property Prediction"}],"methods":[{"method_slug":"cluster-gcn","method_name":"Cluster-GCN"},{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[],"methods_introduced":[{"slug":"cluster-gcn","name":"Cluster-GCN","full_name":"Cluster-GCN"}],"results":[{"leaderboard":"/sota/link-property-prediction-on-ogbl-citation2","task":"Link Property Prediction","dataset":"ogbl-citation2","model":"ClusterGCN (GCN aggr)","rank_in_archive_order":18,"of":23,"metrics":{"Ext. data":"No","Number of params":"296449","Test MRR":"0.8004 ± 0.0025","Validation MRR":"0.7994 ± 0.0025"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-amazon2m","task":"Node Classification","dataset":"Amazon2M","model":"Cluster-GCN","rank_in_archive_order":1,"of":1,"metrics":{"F1":"90.41"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-ppi","task":"Node Classification","dataset":"PPI","model":"Cluster-GCN","rank_in_archive_order":9,"of":24,"metrics":{"F1":"99.36"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-ppi","task":"Node Classification","dataset":"PPI","model":"ClusterGCN","rank_in_archive_order":18,"of":24,"metrics":{"F1":"92.9"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"ClusterGCN","rank_in_archive_order":68,"of":70,"metrics":{"F1":"79.9"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","task":"Node Property Prediction","dataset":"ogbn-mag","model":"ClusterGCN (R-GCN aggr)","rank_in_archive_order":35,"of":39,"metrics":{"Ext. data":"No","Number of params":"154366772","Test Accuracy":"0.3732 ± 0.0037","Validation Accuracy":"0.3840 ± 0.0031"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"ClusterGCN+residual+3 layers","rank_in_archive_order":47,"of":64,"metrics":{"Ext. data":"No","Number of params":"456034","Test Accuracy":"0.7971 ± 0.0042","Validation Accuracy":"0.9188 ± 0.0008"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"Cluster-GAT","rank_in_archive_order":50,"of":64,"metrics":{"Ext. data":"No","Number of params":"1540848","Test Accuracy":"0.7923 ± 0.0078","Validation Accuracy":"0.8985 ± 0.0022"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"ClusterGCN (SAGE aggr)","rank_in_archive_order":52,"of":64,"metrics":{"Ext. data":"No","Number of params":"206895","Test Accuracy":"0.7897 ± 0.0033","Validation Accuracy":"0.9212 ± 0.0009"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.07953","atlas_url":"https://app.syntology.ai/?focus=1905.07953","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":"1905.07953"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.07953\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.07953"},"call":"get_concepts_for_paper(arxiv_id=\"1905.07953\")"}],"by_repo":[{"repo":"google-research/google-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":24,"harvested_for":["1802.03268","2003.12022","2004.13912","2006.04678","2006.15055","2007.07314","2009.14794","2104.04657","2105.01237","2106.03314","2106.03760","2106.11905","2107.05768","2110.11346","2111.06888","2201.08896","2202.00512","2209.14881","2210.15458","2303.00732","2305.07011","2305.16381","2310.18893","2405.05349"],"harvested_for_calls":[{"arxiv_id":"1802.03268","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.03268"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.03268\")"},{"arxiv_id":"2003.12022","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.12022"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.12022\")"},{"arxiv_id":"2004.13912","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.13912"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.13912\")"},{"arxiv_id":"2006.04678","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04678"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04678\")"},{"arxiv_id":"2006.15055","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.15055"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.15055\")"},{"arxiv_id":"2007.07314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.07314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.07314\")"},{"arxiv_id":"2009.14794","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.14794"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.14794\")"},{"arxiv_id":"2104.04657","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.04657"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.04657\")"},{"arxiv_id":"2105.01237","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01237"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01237\")"},{"arxiv_id":"2106.03314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03314\")"},{"arxiv_id":"2106.03760","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03760"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03760\")"},{"arxiv_id":"2106.11905","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.11905"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.11905\")"},{"arxiv_id":"2107.05768","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.05768"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.05768\")"},{"arxiv_id":"2110.11346","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.11346"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.11346\")"},{"arxiv_id":"2111.06888","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.06888"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.06888\")"},{"arxiv_id":"2201.08896","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.08896"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.08896\")"},{"arxiv_id":"2202.00512","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.00512"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.00512\")"},{"arxiv_id":"2209.14881","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.14881"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.14881\")"},{"arxiv_id":"2210.15458","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.15458"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.15458\")"},{"arxiv_id":"2303.00732","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2303.00732"},"call":"get_harvested_code_for_paper(arxiv_id=\"2303.00732\")"},{"arxiv_id":"2305.07011","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.07011"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.07011\")"},{"arxiv_id":"2305.16381","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16381"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.16381\")"},{"arxiv_id":"2310.18893","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.18893"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.18893\")"},{"arxiv_id":"2405.05349","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.05349"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.05349\")"}]},{"repo":"NIRVANALAN/ClusterGCN_google-reseach","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"benedekrozemberczki/ClusterGCN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"qitianwu/nodeformer","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2306.08385"],"harvested_for_calls":[{"arxiv_id":"2306.08385","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.08385"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.08385\")"}]},{"repo":"zhengjingwei/cluster_GCN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"04bd7f42d270ba86597f35b36d81f4a387b1b96b56b5c2e968e75ee137a789f8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}