Papers › CLOSURE: Assessing Systematic Generalization of CLEVR Models

CLOSURE: Assessing Systematic Generalization of CLEVR Models

12 Dec 2019arXiv:1912.05783archive 2025-07-28

Dzmitry Bahdanau, Harm de Vries, Timothy J. O'Donnell, Shikhar Murty, Philippe Beaudoin, Yoshua Bengio, Aaron Courville

The CLEVR dataset of natural-looking questions about 3D-rendered scenes has recently received much attention from the research community. A number of models have been proposed for this task, many of which achieved very high accuracies of around 97-99%. In this work, we study how systematic the generalization of such models is, that is to which extent they are capable of handling novel combinations of known linguistic constructs. To this end, we test models' understanding of referring expressions based on matching object properties (such as e.g. "another cube that is the same size as the brown cube") in novel contexts. Our experiments on the thereby constructed CLOSURE benchmark show that state-of-the-art models often do not exhibit systematicity after being trained on CLEVR. Surprisingly, we find that an explicitly compositional Neural Module Network model also generalizes badly on CLOSURE, even when it has access to the ground-truth programs at test time. We improve the NMN's systematic generalization by developing a novel Vector-NMN module architecture with vector-valued inputs and outputs. Lastly, we investigate how much few-shot transfer learning can help models that are pretrained on CLEVR to adapt to CLOSURE. Our few-shot learning experiments contrast the adaptation behavior of the models with intermediate discrete programs with that of the end-to-end continuous models.

PaperPDFCodeCode 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="1912.05783")

Code

Syntology Ran 5 of 10 code samples harvested from 3 repositories linked to this paper; 5 have no recorded run. Of those that ran: 2 ran · honoured contract; 3 ran · our draft was wrong.

By repository: official repository: 2 samples from 1 repository, 2 ran; community (archive-listed): 8 samples from 2 repositories, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

rizar/CLOSURE officialmentioned in papermentioned on GitHubpytorch report
raeidsaqur/mgn mentioned on GitHubpytorchMIT report
vanessadamario/understanding_reasoning mentioned 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

10 samples harvested; 5 ran; 2 honoured the contract we drafted; 5 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.

2ran · honoured contract
3ran · our draft was wrong
5unverified

Licence: 2 of the 10 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 3 repositories linked to this paper, official or community; each sample names its own and says which. “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.

get_index rizar/CLOSURE/scripts/run_model.py official repository ran · our draft was wrong fingerprinted licence not identified · pointer only · 3fcd91b7695dd7e6 · report
save_grad rizar/CLOSURE/scripts/run_model.py official repository ran · our draft was wrong licence not identified · pointer only · 4d6893e38a989635 · report
one_or_list vanessadamario/understanding_reasoning/original_library/systematic-generalization-sqoop/scripts/train_model.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 08cd6598ccb1e857 · report
parse_float_list vanessadamario/understanding_reasoning/original_library/systematic-generalization-sqoop/scripts/train_model.py community (archive-listed) ran · honoured contract MIT (permissive) · e7d281257c225992 · report
parse_int_list vanessadamario/understanding_reasoning/original_library/systematic-generalization-sqoop/scripts/train_model.py community (archive-listed) ran · honoured contract MIT (permissive) · db09fab2902ef1f9 · report
logical_not raeidsaqur/mgn/mgn/models/decoder.py community (archive-listed) unverified MIT (permissive) · 8fc4042c8274c184 · report
logical_or raeidsaqur/mgn/mgn/models/decoder.py community (archive-listed) unverified MIT (permissive) · 454f9b451952228a · report
masked_softmax raeidsaqur/mgn/mgn/models/graph_matcher.py community (archive-listed) unverified MIT (permissive) · 7ef9429bb1707360 · report
to_dense raeidsaqur/mgn/mgn/models/graph_matcher.py community (archive-listed) unverified MIT (permissive) · 4d89c0ece4ba3159 · report
to_sparse raeidsaqur/mgn/mgn/models/graph_matcher.py community (archive-listed) unverified MIT (permissive) · 2bf75d6c18b35a77 · report

Tasks

Few-Shot LearningSystematic GeneralizationTransfer Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Test

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