Papers › HL-Net: Heterophily Learning Network for Scene Graph Generation

HL-Net: Heterophily Learning Network for Scene Graph Generation

3 May 2022CVPR 2022 1arXiv:2205.01316archive 2025-07-28

Xin Lin, Changxing Ding, Yibing Zhan, Zijian Li, DaCheng Tao

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.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2205.01316")

Code

Syntology Ran 5 of 9 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 1 ran · honoured contract; 3 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 9 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

siml3/hl-net officialmentioned in paperpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 5 ran; 1 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
3ran · our draft was wrong
1ran
4unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from siml3/HL-Net. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

CalAttenMap siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository ran MIT (permissive) · cb160c29bb986979 · report
boxlist_iou siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository ran · honoured contract MIT (permissive) · fdd5a250b21677e5 · report
nms_overlaps siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 418e364939c18906 · report
reporthook siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository ran · our draft was wrong MIT (permissive) · cec8c324e96be444 · report
to_onehot siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 0cbeff1b7f9a25e0 · report
ART_block siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository unverified MIT (permissive) · 2f227a3f63d6e0b2 · report
ARTs siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository unverified MIT (permissive) · f79b65e2496429c6 · report
load_word_vectors siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository unverified MIT (permissive) · a67e13e540b4c85e · report
obj_edge_vectors siml3/HL-Net/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py official repository unverified MIT (permissive) · 04248b89fd96cd09 · report

Tasks

Graph ClassificationGraph GenerationScene Graph ClassificationScene Graph Generation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections