{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","arxiv_id":"2010.05421","date":"2020-10-12","proceeding":"NeurIPS 2020 12","authors":["Yiding Yang","Zunlei Feng","Mingli Song","Xinchao Wang"],"abstract":"Graphs have been widely adopted to denote structural connections between entities. The relations are in many cases heterogeneous, but entangled together and denoted merely as a single edge between a pair of nodes. For example, in a social network graph, users in different latent relationships like friends and colleagues, are usually connected via a bare edge that conceals such intrinsic connections. In this paper, we introduce a novel graph convolutional network (GCN), termed as factorizable graph convolutional network(FactorGCN), that explicitly disentangles such intertwined relations encoded in a graph. FactorGCN takes a simple graph as input, and disentangles it into several factorized graphs, each of which represents a latent and disentangled relation among nodes. The features of the nodes are then aggregated separately in each factorized latent space to produce disentangled features, which further leads to better performances for downstream tasks. We evaluate the proposed FactorGCN both qualitatively and quantitatively on the synthetic and real-world datasets, and demonstrate that it yields truly encouraging results in terms of both disentangling and feature aggregation. Code is publicly available at https://github.com/ihollywhy/FactorGCN.PyTorch.","url_abs":"https://arxiv.org/abs/2010.05421v1","url_pdf":"https://arxiv.org/pdf/2010.05421v1.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":"factorizable-graph-convolutional-networks","repo_url":"https://github.com/ihollywhy/FactorGCN.PyTorch","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-regression","task_name":"Graph Regression"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset":"COLLAB","model":"FactorGCN","rank_in_archive_order":8,"of":39,"metrics":{"Accuracy":"81.2%","Accuracy (10-fold)":"81.2%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-b","task":"Graph Classification","dataset":"IMDb-B","model":"FactorGCN","rank_in_archive_order":24,"of":51,"metrics":{"Accuracy":"75.3%","Accuracy (10-fold)":"75.3%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"FactorGCN","rank_in_archive_order":26,"of":74,"metrics":{"Accuracy":"89.9%","Accuracy (10-fold)":"89.9%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-zinc","task":"Graph Regression","dataset":"ZINC","model":"FactorGCN","rank_in_archive_order":26,"of":27,"metrics":{"MAE":"0.366"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pattern-100k","task":"Node Classification","dataset":"PATTERN 100k","model":"FactorGCN","rank_in_archive_order":3,"of":9,"metrics":{"Accuracy (%)":"86.57 ± 0.02"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/ihollywhy/FactorGCN.PyTorch","reach":null}],"summary":{"ran_fixture":1,"ran_honours":1},"by_repo_kind":{"official":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"b6a9278872377024","entry":"eval_net","repo":"ihollywhy/FactorGCN.PyTorch","repo_kind":"official","path":"train_gin.py","file_url":"https://github.com/ihollywhy/FactorGCN.PyTorch/blob/HEAD/train_gin.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b6a9278872377024"}},{"code_sha256_prefix":"ba94d2528278f7bf","entry":"get_curve_from_file","repo":"ihollywhy/FactorGCN.PyTorch","repo_kind":"official","path":"evaluation/generate_report.py","file_url":"https://github.com/ihollywhy/FactorGCN.PyTorch/blob/HEAD/evaluation/generate_report.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ba94d2528278f7bf"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}