Papers › Groupwise Query Specialization and Quality-Aware Multi-Assignment for...

Groupwise Query Specialization and Quality-Aware Multi-Assignment for Transformer-based Visual Relationship Detection

26 Mar 2024CVPR 2024 1arXiv:2403.17709archive 2025-07-28

Jongha Kim, Jihwan Park, Jinyoung Park, Jinyoung Kim, Sehyung Kim, Hyunwoo J. Kim

Visual Relationship Detection (VRD) has seen significant advancements with Transformer-based architectures recently. However, we identify two key limitations in a conventional label assignment for training Transformer-based VRD models, which is a process of mapping a ground-truth (GT) to a prediction. Under the conventional assignment, an unspecialized query is trained since a query is expected to detect every relation, which makes it difficult for a query to specialize in specific relations. Furthermore, a query is also insufficiently trained since a GT is assigned only to a single prediction, therefore near-correct or even correct predictions are suppressed by being assigned no relation as a GT. To address these issues, we propose Groupwise Query Specialization and Quality-Aware Multi-Assignment (SpeaQ). Groupwise Query Specialization trains a specialized query by dividing queries and relations into disjoint groups and directing a query in a specific query group solely toward relations in the corresponding relation group. Quality-Aware Multi-Assignment further facilitates the training by assigning a GT to multiple predictions that are significantly close to a GT in terms of a subject, an object, and the relation in between. Experimental results and analyses show that SpeaQ effectively trains specialized queries, which better utilize the capacity of a model, resulting in consistent performance gains with zero additional inference cost across multiple VRD models and benchmarks. Code is available at https://github.com/mlvlab/SpeaQ.

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="2403.17709")

Code

Syntology Ran 1 of 3 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 1 ran with no contract checked.

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

mlvlab/speaq officialmentioned in papermentioned on GitHubpytorch 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

3 samples harvested; 1 ran; 0 honoured the contract we drafted; 2 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
2unverified

Licence: 3 of the 3 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 mlvlab/SpeaQ. “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.

gen_sineembed_for_position mlvlab/SpeaQ/modeling/transformer/detr.py official repository ran fingerprinted no licence file found · pointer only · 0f17ae0853df90a4 · report
argsort_desc mlvlab/SpeaQ/evaluation/utils.py official repository unverified no licence file found · pointer only · 7d4002289969a288 · report
intersect_2d mlvlab/SpeaQ/evaluation/utils.py official repository unverified no licence file found · pointer only · 6727d2d8f1d79998 · report

Tasks

Relationship DetectionScene Graph GenerationVisual Relationship Detection

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Scene Graph Generation Visual Genome SpeaQ (without reweighting) R@100 36.0 #1 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (without reweighting) Recall@100 36.0 #1 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (without reweighting) Recall@50 32.9 #1 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (without reweighting) mR@100 14.1 #1 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (without reweighting) mR@50 11.8 #1 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (without reweighting) mean Recall @100 14.1 #1 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (with reweighting) R@100 35.5 #2 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (with reweighting) Recall@100 35.5 #2 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (with reweighting) Recall@50 32.1 #2 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (with reweighting) mR@100 17.6 #2 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (with reweighting) mR@50 15.1 #2 of 19 Archive leaderboard report
Scene Graph Generation Visual Genome SpeaQ (with reweighting) mean Recall @100 17.6 #2 of 19 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

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