{"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/hl-net-heterophily-learning-network-for-scene","title":"HL-Net: Heterophily Learning Network for Scene Graph Generation","arxiv_id":"2205.01316","date":"2022-05-03","proceeding":"CVPR 2022 1","authors":["Xin Lin","Changxing Ding","Yibing Zhan","Zijian Li","DaCheng Tao"],"abstract":"Scene graph generation (SGG) aims to detect objects and predict their pairwise relationships within an image. Current SGG methods typically utilize graph neural networks (GNNs) to acquire context information between objects/relationships. Despite their effectiveness, however, current SGG methods only assume scene graph homophily while ignoring heterophily. Accordingly, in this paper, we propose a novel Heterophily Learning Network (HL-Net) to comprehensively explore the homophily and heterophily between objects/relationships in scene graphs. More specifically, HL-Net comprises the following 1) an adaptive reweighting transformer module, which adaptively integrates the information from different layers to exploit both the heterophily and homophily in objects; 2) a relationship feature propagation module that efficiently explores the connections between relationships by considering heterophily in order to refine the relationship representation; 3) a heterophily-aware message-passing scheme to further distinguish the heterophily and homophily between objects/relationships, thereby facilitating improved message passing in graphs. We conducted extensive experiments on two public datasets: Visual Genome (VG) and Open Images (OI). The experimental results demonstrate the superiority of our proposed HL-Net over existing state-of-the-art approaches. In more detail, HL-Net outperforms the second-best competitors by 2.1$\\%$ on the VG dataset for scene graph classification and 1.2$\\%$ on the IO dataset for the final score. Code is available at https://github.com/siml3/HL-Net.","url_abs":"https://arxiv.org/abs/2205.01316v2","url_pdf":"https://arxiv.org/pdf/2205.01316v2.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":"hl-net-heterophily-learning-network-for-scene","repo_url":"https://github.com/siml3/hl-net","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-generation","task_name":"Graph Generation"},{"task_slug":"scene-graph-classification","task_name":"Scene Graph Classification"},{"task_slug":"scene-graph-generation","task_name":"Scene Graph Generation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2205.01316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01316"}},"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/siml3/HL-Net","reach":null}],"summary":{"ran":1,"ran_honours":1,"ran_draft_wrong":3,"unverified":4},"by_repo_kind":{"official":{"samples":9,"ran":5,"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":"cb160c29bb986979","entry":"CalAttenMap","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cb160c29bb986979"}},{"code_sha256_prefix":"fdd5a250b21677e5","entry":"boxlist_iou","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fdd5a250b21677e5"}},{"code_sha256_prefix":"418e364939c18906","entry":"nms_overlaps","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"418e364939c18906"}},{"code_sha256_prefix":"cec8c324e96be444","entry":"reporthook","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cec8c324e96be444"}},{"code_sha256_prefix":"0cbeff1b7f9a25e0","entry":"to_onehot","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0cbeff1b7f9a25e0"}},{"code_sha256_prefix":"2f227a3f63d6e0b2","entry":"ART_block","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.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":"2f227a3f63d6e0b2"}},{"code_sha256_prefix":"f79b65e2496429c6","entry":"ARTs","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.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":"f79b65e2496429c6"}},{"code_sha256_prefix":"a67e13e540b4c85e","entry":"load_word_vectors","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.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":"a67e13e540b4c85e"}},{"code_sha256_prefix":"04248b89fd96cd09","entry":"obj_edge_vectors","repo":"siml3/HL-Net","repo_kind":"official","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.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":"04248b89fd96cd09"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}