{"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/two-sides-of-the-same-coin-heterophily-and","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","arxiv_id":"2102.06462","date":"2021-02-12","proceeding":null,"authors":["Yujun Yan","Milad Hashemi","Kevin Swersky","Yaoqing Yang","Danai Koutra"],"abstract":"In node classification tasks, graph convolutional neural networks (GCNs) have demonstrated competitive performance over traditional methods on diverse graph data. However, it is known that the performance of GCNs degrades with increasing number of layers (oversmoothing problem) and recent studies have also shown that GCNs may perform worse in heterophilous graphs, where neighboring nodes tend to belong to different classes (heterophily problem). These two problems are usually viewed as unrelated, and thus are studied independently, often at the graph filter level from a spectral perspective. We are the first to take a unified perspective to jointly explain the oversmoothing and heterophily problems at the node level. Specifically, we profile the nodes via two quantitative metrics: the relative degree of a node (compared to its neighbors) and the node-level heterophily. Our theory shows that the interplay of these two profiling metrics defines three cases of node behaviors, which explain the oversmoothing and heterophily problems jointly and can predict the performance of GCNs. Based on insights from our theory, we show theoretically and empirically the effectiveness of two strategies: structure-based edge correction, which learns corrected edge weights from structural properties (i.e., degrees), and feature-based edge correction, which learns signed edge weights from node features. Compared to other approaches, which tend to handle well either heterophily or oversmoothing, we show that {our model, GGCN}, which incorporates the two strategies performs well in both problems.","url_abs":"https://arxiv.org/abs/2102.06462v8","url_pdf":"https://arxiv.org/pdf/2102.06462v8.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":"two-sides-of-the-same-coin-heterophily-and","repo_url":"https://github.com/yujun-yan/heterophily_and_oversmoothing","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-classification-on-non-homophilic","task_name":"Node Classification on Non-Homophilic (Heterophilic) Graphs"}],"methods":[{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-actor","task":"Node Classification","dataset":"Actor","model":"GGCN","rank_in_archive_order":21,"of":62,"metrics":{"Accuracy":"37.54 ± 1.56"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-chameleon","task":"Node Classification","dataset":"Chameleon","model":"GGCN","rank_in_archive_order":26,"of":61,"metrics":{"Accuracy":"71.14 ± 1.84"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-48-32-20","task":"Node Classification","dataset":"Citeseer (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":9,"of":26,"metrics":{"1:1 Accuracy":"77.14 ± 1.45"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-48-32-20-fixed","task":"Node Classification","dataset":"Cora (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":14,"of":26,"metrics":{"1:1 Accuracy":"87.95 ± 1.05"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cornell","task":"Node Classification","dataset":"Cornell","model":"GGCN","rank_in_archive_order":17,"of":60,"metrics":{"Accuracy":"85.68 ± 6.63"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-48-32-20-fixed","task":"Node Classification","dataset":"PubMed (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":15,"of":26,"metrics":{"1:1 Accuracy":"89.15 ± 0.37"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-squirrel","task":"Node Classification","dataset":"Squirrel","model":"GGCN","rank_in_archive_order":37,"of":59,"metrics":{"Accuracy":"55.17 ± 1.58"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-texas","task":"Node Classification","dataset":"Texas","model":"GGCN","rank_in_archive_order":31,"of":62,"metrics":{"Accuracy":"84.86 ± 4.55"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-wisconsin","task":"Node Classification","dataset":"Wisconsin","model":"GGCN","rank_in_archive_order":34,"of":63,"metrics":{"Accuracy":"86.86 ± 3.29"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-11","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Chameleon (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":9,"of":29,"metrics":{"1:1 Accuracy":"71.14 ±1.84"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-7","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Cornell (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":6,"of":27,"metrics":{"1:1 Accuracy":"85.68 ± 6.63 "},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-10","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Film(48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":6,"of":26,"metrics":{"1:1 Accuracy":"37.54 ± 1.56 "},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-10","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Film(48%/32%/20% fixed splits)","model":"GPRGCN","rank_in_archive_order":21,"of":26,"metrics":{"1:1 Accuracy":"35.16 ± 0.9"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-12","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Squirrel (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":16,"of":29,"metrics":{"1:1 Accuracy":"55.17 ± 1.58"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-9","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Texas (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":11,"of":26,"metrics":{"1:1 Accuracy":"84.86 ± 4.55"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-8","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Wisconsin (48%/32%/20% fixed splits)","model":"GGCN","rank_in_archive_order":15,"of":26,"metrics":{"1:1 Accuracy":"86.86 ± 3.29 "},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2102.06462","atlas_url":"https://app.syntology.ai/?focus=2102.06462","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":"2102.06462"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2102.06462\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2102.06462"},"call":"get_concepts_for_paper(arxiv_id=\"2102.06462\")"}],"by_repo":[{"repo":"yujun-yan/heterophily_and_oversmoothing","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":"b632bccc22adaa894cd3c2aaa98ada62e4aa043e1ef79264c94909043ebe61f7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}