{"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/advancing-graphsage-with-a-data-driven-node","title":"Advancing GraphSAGE with A Data-Driven Node Sampling","arxiv_id":"1904.12935","date":"2019-04-29","proceeding":null,"authors":["Jihun Oh","Kyunghyun Cho","Joan Bruna"],"abstract":"As an efficient and scalable graph neural network, GraphSAGE has enabled an\ninductive capability for inferring unseen nodes or graphs by aggregating\nsubsampled local neighborhoods and by learning in a mini-batch gradient descent\nfashion. The neighborhood sampling used in GraphSAGE is effective in order to\nimprove computing and memory efficiency when inferring a batch of target nodes\nwith diverse degrees in parallel. Despite this advantage, the default uniform\nsampling suffers from high variance in training and inference, leading to\nsub-optimum accuracy. We propose a new data-driven sampling approach to reason\nabout the real-valued importance of a neighborhood by a non-linear regressor,\nand to use the value as a criterion for subsampling neighborhoods. The\nregressor is learned using a value-based reinforcement learning. The implied\nimportance for each combination of vertex and neighborhood is inductively\nextracted from the negative classification loss output of GraphSAGE. As a\nresult, in an inductive node classification benchmark using three datasets, our\nmethod enhanced the baseline using the uniform sampling, outperforming recent\nvariants of a graph neural network in accuracy.","url_abs":"http://arxiv.org/abs/1904.12935v1","url_pdf":"http://arxiv.org/pdf/1904.12935v1.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":"advancing-graphsage-with-a-data-driven-node","repo_url":"https://github.com/oj9040/GraphSAGE_RL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"},{"method_slug":"graphsage","method_name":"GraphSAGE"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.12935","atlas_url":"https://app.syntology.ai/?focus=1904.12935","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":"1904.12935"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.12935\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.12935"},"call":"get_concepts_for_paper(arxiv_id=\"1904.12935\")"}],"by_repo":[{"repo":"oj9040/GraphSAGE_RL","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":"20557c7c42d51205617bbb89beeae5b4b49cee71d3f3aa8d6cc9933bcd869b56","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}