{"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/adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","arxiv_id":"1809.05343","date":"2018-09-14","proceeding":"NeurIPS 2018 12","authors":["Wenbing Huang","Tong Zhang","Yu Rong","Junzhou Huang"],"abstract":"Graph Convolutional Networks (GCNs) have become a crucial tool on learning\nrepresentations of graph vertices. The main challenge of adapting GCNs on\nlarge-scale graphs is the scalability issue that it incurs heavy cost both in\ncomputation and memory due to the uncontrollable neighborhood expansion across\nlayers. In this paper, we accelerate the training of GCNs through developing an\nadaptive layer-wise sampling method. By constructing the network layer by layer\nin a top-down passway, we sample the lower layer conditioned on the top one,\nwhere the sampled neighborhoods are shared by different parent nodes and the\nover expansion is avoided owing to the fixed-size sampling. More importantly,\nthe proposed sampler is adaptive and applicable for explicit variance\nreduction, which in turn enhances the training of our method. Furthermore, we\npropose a novel and economical approach to promote the message passing over\ndistant nodes by applying skip connections. Intensive experiments on several\nbenchmarks verify the effectiveness of our method regarding the classification\naccuracy while enjoying faster convergence speed.","url_abs":"http://arxiv.org/abs/1809.05343v3","url_pdf":"http://arxiv.org/pdf/1809.05343v3.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":"adaptive-sampling-towards-fast-graph","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/_deprecated/adaptive_sampling","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"adaptive-sampling-towards-fast-graph","repo_url":"https://github.com/huangwb/AS-GCN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-citeseer-full","task":"Node Classification","dataset":"Citeseer Full-supervised","model":"ASGCN","rank_in_archive_order":2,"of":7,"metrics":{"Accuracy":"79.66%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"AS-GCN","rank_in_archive_order":16,"of":73,"metrics":{"Accuracy":"87.44% ± 0.0034%"},"uses_additional_data":true},{"leaderboard":"/sota/node-classification-on-cora-full-supervised","task":"Node Classification","dataset":"Cora Full-supervised","model":"ASGCN","rank_in_archive_order":4,"of":9,"metrics":{"Accuracy":"87.44±0.0034%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-full-supervised","task":"Node Classification","dataset":"Pubmed Full-supervised","model":"ASGCN","rank_in_archive_order":2,"of":7,"metrics":{"Accuracy":"90.6%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-reddit","task":"Node Classification","dataset":"Reddit","model":"ASGCN","rank_in_archive_order":9,"of":16,"metrics":{"Accuracy":"96.27%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.05343","atlas_url":"https://app.syntology.ai/?focus=1809.05343","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":"1809.05343"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.05343\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.05343"},"call":"get_concepts_for_paper(arxiv_id=\"1809.05343\")"}],"by_repo":[{"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\")"}]},{"repo":"huangwb/AS-GCN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"0188dd26de41bb97de6323536ce1ea7f9792f5c2b89e9f35d88c77bc5059f06e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}