{"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/grand-scalable-graph-random-neural-networks","title":"GRAND+: Scalable Graph Random Neural Networks","arxiv_id":"2203.06389","date":"2022-03-12","proceeding":null,"authors":["Wenzheng Feng","Yuxiao Dong","Tinglin Huang","Ziqi Yin","Xu Cheng","Evgeny Kharlamov","Jie Tang"],"abstract":"Graph neural networks (GNNs) have been widely adopted for semi-supervised learning on graphs. A recent study shows that the graph random neural network (GRAND) model can generate state-of-the-art performance for this problem. However, it is difficult for GRAND to handle large-scale graphs since its effectiveness relies on computationally expensive data augmentation procedures. In this work, we present a scalable and high-performance GNN framework GRAND+ for semi-supervised graph learning. To address the above issue, we develop a generalized forward push (GFPush) algorithm in GRAND+ to pre-compute a general propagation matrix and employ it to perform graph data augmentation in a mini-batch manner. We show that both the low time and space complexities of GFPush enable GRAND+ to efficiently scale to large graphs. Furthermore, we introduce a confidence-aware consistency loss into the model optimization of GRAND+, facilitating GRAND+'s generalization superiority. We conduct extensive experiments on seven public datasets of different sizes. The results demonstrate that GRAND+ 1) is able to scale to large graphs and costs less running time than existing scalable GNNs, and 2) can offer consistent accuracy improvements over both full-batch and scalable GNNs across all datasets.","url_abs":"https://arxiv.org/abs/2203.06389v1","url_pdf":"https://arxiv.org/pdf/2203.06389v1.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":"grand-scalable-graph-random-neural-networks","repo_url":"https://github.com/wzfhaha/grand-plus","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"model-optimization","task_name":"Model Optimization"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-mag-scholar-c","task":"Node Classification","dataset":"MAG-scholar-C","model":"FastGCN","rank_in_archive_order":1,"of":4,"metrics":{"Accuracy":"64.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mag-scholar-c","task":"Node Classification","dataset":"MAG-scholar-C","model":"PPRGo","rank_in_archive_order":2,"of":4,"metrics":{"Accuracy":"72.9"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mag-scholar-c","task":"Node Classification","dataset":"MAG-scholar-C","model":"GraphSAINT","rank_in_archive_order":3,"of":4,"metrics":{"Accuracy":"75.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mag-scholar-c","task":"Node Classification","dataset":"MAG-scholar-C","model":"GRAND+","rank_in_archive_order":4,"of":4,"metrics":{"Accuracy":"80.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.06389","atlas_url":"https://app.syntology.ai/?focus=2203.06389","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":"2203.06389"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2203.06389\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2203.06389"},"call":"get_concepts_for_paper(arxiv_id=\"2203.06389\")"}],"by_repo":[{"repo":"wzfhaha/grand-plus","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":"30b00ac27a65e6fb68a848744dcdc5c40e41fb70c74dfd942065f454c96fe0e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}