{"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/graph-information-bottleneck-for-subgraph-1","title":"Graph Information Bottleneck for Subgraph Recognition","arxiv_id":"2010.05563","date":"2020-10-12","proceeding":"ICLR 2021 1","authors":["Junchi Yu","Tingyang Xu","Yu Rong","Yatao Bian","Junzhou Huang","Ran He"],"abstract":"Given the input graph and its label/property, several key problems of graph learning, such as finding interpretable subgraphs, graph denoising and graph compression, can be attributed to the fundamental problem of recognizing a subgraph of the original one. This subgraph shall be as informative as possible, yet contains less redundant and noisy structure. This problem setting is closely related to the well-known information bottleneck (IB) principle, which, however, has less been studied for the irregular graph data and graph neural networks (GNNs). In this paper, we propose a framework of Graph Information Bottleneck (GIB) for the subgraph recognition problem in deep graph learning. Under this framework, one can recognize the maximally informative yet compressive subgraph, named IB-subgraph. However, the GIB objective is notoriously hard to optimize, mostly due to the intractability of the mutual information of irregular graph data and the unstable optimization process. In order to tackle these challenges, we propose: i) a GIB objective based-on a mutual information estimator for the irregular graph data; ii) a bi-level optimization scheme to maximize the GIB objective; iii) a connectivity loss to stabilize the optimization process. We evaluate the properties of the IB-subgraph in three application scenarios: improvement of graph classification, graph interpretation and graph denoising. Extensive experiments demonstrate that the information-theoretic IB-subgraph enjoys superior graph properties.","url_abs":"https://arxiv.org/abs/2010.05563v1","url_pdf":"https://arxiv.org/pdf/2010.05563v1.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":"graph-information-bottleneck-for-subgraph-1","repo_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-learning","task_name":"Graph Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2010.05563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05563"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":1,"ran_honours":1,"unverified":5},"by_repo_kind":{"official":{"samples":7,"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":"8a60d7e1fd8f0dbe","entry":"k_fold","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","repo_kind":"official","path":"graph-classfication/ours_train_eval.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-classfication/ours_train_eval.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8a60d7e1fd8f0dbe"}},{"code_sha256_prefix":"9da87b0b1605a660","entry":"num_graphs","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","repo_kind":"official","path":"graph-classfication/ours_train_eval.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-classfication/ours_train_eval.py","link_basis":"harvester_set","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":"9da87b0b1605a660"}},{"code_sha256_prefix":"003c863eba48841e","entry":"cross_validation_with_val_set","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","repo_kind":"official","path":"graph-classfication/ours_train_eval.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-classfication/ours_train_eval.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"003c863eba48841e"}},{"code_sha256_prefix":"447832767a387876","entry":"get_dataset","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","repo_kind":"official","path":"graph-classfication/datasets.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-classfication/datasets.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"447832767a387876"}},{"code_sha256_prefix":"678727c26290b1bb","entry":"graph_level_reader","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","repo_kind":"official","path":"graph-interpretation/model/utils.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-interpretation/model/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"678727c26290b1bb"}},{"code_sha256_prefix":"e7df7995c8536ad7","entry":"hierarchical_graph_reader","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","repo_kind":"official","path":"graph-interpretation/model/utils.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-interpretation/model/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e7df7995c8536ad7"}},{"code_sha256_prefix":"39bce85e40cd2642","entry":"preprocess","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","repo_kind":"official","path":"graph-interpretation/preprocess.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-interpretation/preprocess.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"39bce85e40cd2642"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}