{"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/new-benchmarks-for-learning-on-non","title":"New Benchmarks for Learning on Non-Homophilous Graphs","arxiv_id":"2104.01404","date":"2021-04-03","proceeding":null,"authors":["Derek Lim","Xiuyu Li","Felix Hohne","Ser-Nam Lim"],"abstract":"Much data with graph structures satisfy the principle of homophily, meaning that connected nodes tend to be similar with respect to a specific attribute. As such, ubiquitous datasets for graph machine learning tasks have generally been highly homophilous, rewarding methods that leverage homophily as an inductive bias. Recent work has pointed out this particular focus, as new non-homophilous datasets have been introduced and graph representation learning models better suited for low-homophily settings have been developed. However, these datasets are small and poorly suited to truly testing the effectiveness of new methods in non-homophilous settings. We present a series of improved graph datasets with node label relationships that do not satisfy the homophily principle. Along with this, we introduce a new measure of the presence or absence of homophily that is better suited than existing measures in different regimes. We benchmark a range of simple methods and graph neural networks across our proposed datasets, drawing new insights for further research. Data and codes can be found at https://github.com/CUAI/Non-Homophily-Benchmarks.","url_abs":"https://arxiv.org/abs/2104.01404v2","url_pdf":"https://arxiv.org/pdf/2104.01404v2.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":"new-benchmarks-for-learning-on-non","repo_url":"https://github.com/CUAI/Non-Homophily-Benchmarks","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"fraud-detection","task_name":"Fraud Detection"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"inductive-bias","task_name":"Inductive Bias"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-classification-on-non-homophilic","task_name":"Node Classification on Non-Homophilic (Heterophilic) Graphs"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[{"slug":"deezer-europe-1","name":"Deezer-Europe","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/fraud-detection-on-yelp-fraud","task":"Fraud Detection","dataset":"Yelp-Fraud","model":"GAT+JK","rank_in_archive_order":6,"of":10,"metrics":{"AUC-ROC":"90.04"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"GCNJK","rank_in_archive_order":18,"of":32,"metrics":{"Accuracy":"81.63 ± 0.54"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"LINK","rank_in_archive_order":22,"of":32,"metrics":{"Accuracy":"80.79 ± 0.49"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"GATJK","rank_in_archive_order":23,"of":32,"metrics":{"Accuracy":"80.69 ± 0.36"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"L Prop 2-hop","rank_in_archive_order":29,"of":32,"metrics":{"Accuracy":"74.13 ± 0.46"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"MLP","rank_in_archive_order":30,"of":32,"metrics":{"Accuracy":"73.61 ± 0.40"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"L Prop 1-hop","rank_in_archive_order":32,"of":32,"metrics":{"Accuracy":"63.21 ± 0.39"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-yelpchi","task":"Node Classification","dataset":"Yelp-Fraud","model":"GAT+JK","rank_in_archive_order":5,"of":9,"metrics":{"AUC-ROC":"90.04"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-genius","task":"Node Classification","dataset":"genius","model":"LINK","rank_in_archive_order":21,"of":26,"metrics":{"Accuracy":"73.56 ± 0.14"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-genius","task":"Node Classification","dataset":"genius","model":"L Prop 2-hop","rank_in_archive_order":22,"of":26,"metrics":{"Accuracy":"67.04 ± 0.20"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-genius","task":"Node Classification","dataset":"genius","model":"L Prop 1-hop","rank_in_archive_order":23,"of":26,"metrics":{"Accuracy":"66.02 ± 0.16"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-genius","task":"Node Classification","dataset":"genius","model":"GATJK","rank_in_archive_order":24,"of":26,"metrics":{"Accuracy":"56.70 ± 2.07"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"MLP-2","rank_in_archive_order":14,"of":28,"metrics":{"1:1 Accuracy":"66.55±0.72"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"GCN+JK","rank_in_archive_order":23,"of":28,"metrics":{"1:1 Accuracy":"60.99±0.14"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"GAT+JK","rank_in_archive_order":25,"of":28,"metrics":{"1:1 Accuracy":"59.66±0.92"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"LINK","rank_in_archive_order":26,"of":28,"metrics":{"1:1 Accuracy":"57.71±0.36"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"LProp (2hop)","rank_in_archive_order":27,"of":28,"metrics":{"1:1 Accuracy":"56.96±0.26"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"L Prop (1hop)","rank_in_archive_order":28,"of":28,"metrics":{"1:1 Accuracy":"56.50±0.41"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-1","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Wisconsin(60%/20%/20% random splits)","model":"MLP-2","rank_in_archive_order":14,"of":32,"metrics":{"1:1 Accuracy":"93.87 ± 3.33"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2104.01404","atlas_url":"https://app.syntology.ai/?focus=2104.01404","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":"2104.01404"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2104.01404\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2104.01404"},"call":"get_concepts_for_paper(arxiv_id=\"2104.01404\")"}],"by_repo":[{"repo":"CUAI/Non-Homophily-Benchmarks","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.14446"],"harvested_for_calls":[{"arxiv_id":"2110.14446","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.14446"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.14446\")"}]}],"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":"2e2311c6c5e38cbc055bc4c81159abbff09b32b6f0a56f0e8f4026ee56e22182","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}