{"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/simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","arxiv_id":"2301.12562","date":"2023-01-29","proceeding":null,"authors":["Paul Louis","Shweta Ann Jacob","Amirali Salehi-Abari"],"abstract":"Link prediction on graphs is a fundamental problem. Subgraph representation learning approaches (SGRLs), by transforming link prediction to graph classification on the subgraphs around the links, have achieved state-of-the-art performance in link prediction. However, SGRLs are computationally expensive, and not scalable to large-scale graphs due to expensive subgraph-level operations. To unlock the scalability of SGRLs, we propose a new class of SGRLs, that we call Scalable Simplified SGRL (S3GRL). Aimed at faster training and inference, S3GRL simplifies the message passing and aggregation operations in each link's subgraph. S3GRL, as a scalability framework, accommodates various subgraph sampling strategies and diffusion operators to emulate computationally-expensive SGRLs. We propose multiple instances of S3GRL and empirically study them on small to large-scale graphs. Our extensive experiments demonstrate that the proposed S3GRL models scale up SGRLs without significant performance compromise (even with considerable gains in some cases), while offering substantially lower computational footprints (e.g., multi-fold inference and training speedup).","url_abs":"https://arxiv.org/abs/2301.12562v4","url_pdf":"https://arxiv.org/pdf/2301.12562v4.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":"simplifying-subgraph-representation-learning","repo_url":"https://github.com/venomouscyanide/s3grl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"simplifying-subgraph-representation-learning","repo_url":"https://github.com/venomouscyanide/s3grl_ogb","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"simplifying-subgraph-representation-learning","repo_url":"https://github.com/venomouscyanide/S3GRL_OGB","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-property-prediction-on-ogbl-citation2","task":"Link Property Prediction","dataset":"ogbl-citation2","model":"S3GRL (PoS Plus)","rank_in_archive_order":9,"of":23,"metrics":{"Ext. data":"No","Number of params":"142275001","Test MRR":"0.8814 ± 0.0008","Validation MRR":"0.8809 ± 0.0074"},"uses_additional_data":false},{"leaderboard":"/sota/link-property-prediction-on-ogbl-collab","task":"Link Property Prediction","dataset":"ogbl-collab","model":"S3GRL (PoS Plus)","rank_in_archive_order":11,"of":34,"metrics":{"Ext. data":"No","Number of params":"5913025","Test Hits@50":"0.6683 ± 0.0030","Validation Hits@50":"0.9861 ± 0.0006"},"uses_additional_data":false},{"leaderboard":"/sota/link-property-prediction-on-ogbl-ppa","task":"Link Property Prediction","dataset":"ogbl-ppa","model":"S3GRL (PoS Plus)","rank_in_archive_order":16,"of":26,"metrics":{"Ext. data":"No","Number of params":"32270001","Test Hits@100":"0.4242 ± 0.0180","Validation Hits@100":"0.6512 ± 0.0109"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2301.12562","atlas_url":"https://app.syntology.ai/?focus=2301.12562","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":"2301.12562"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2301.12562\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2301.12562"},"call":"get_concepts_for_paper(arxiv_id=\"2301.12562\")"}],"by_repo":[{"repo":"venomouscyanide/s3grl","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"venomouscyanide/s3grl_ogb","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1603.08861"],"harvested_for_calls":[{"arxiv_id":"1603.08861","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1603.08861"},"call":"get_harvested_code_for_paper(arxiv_id=\"1603.08861\")"}]}],"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":"b96c2bfe2082db7d5dbc995db30aa04128be0bbec1e8ead685eb8d5a66ecc4ec","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}