In recent years, neural network based models have become the workhorse of natural language understanding and generation. They empower industrial systems in machine translation BIBREF0 and text generation BIBREF1 , also showing state-of-the-art performance on numerous benchmarks including Recognizing Textual Entailment (RTE) BIBREF2 , Visual Question Answering (VQA) BIBREF3 , and Reading Comprehension BIBREF4 . Despite these successes, a growing body of literature suggests that these approaches do not generalize outside of the specific distributions on which they are trained, something that is necessary for a language understanding system to be widely deployed in the real world. Investigations on the three aforementioned tasks have shown that neural models easily latch onto statistical regularities which are omnipresent in existing datasets BIBREF5 , BIBREF6 , BIBREF7 and extremely hard to avoid in large scale data collection. Having learned such dataset-specific solutions, neural networks fail to make correct predictions for examples that are even slightly out of domain, yet are trivial for humans. These findings have been corroborated by a recent investigation on a synthetic instruction-following task BIBREF8 , in which seq2seq models BIBREF9 , BIBREF10 have shown little systematicity BIBREF11 in how they generalize, that is they do not learn general rules on how to compose words and fail spectacularly when for example asked to interpret “jump twice” after training on “jump”, “run twice” and “walk twice”.An appealing direction to improve the generalization capabilities of neural models is to add modularity and structure to their design to make them structurally resemble the kind of rules they are supposed to learn BIBREF12 , BIBREF13 . For example, in the Neural Module Network paradigm (NMN, BIBREF12 ), a neural network is assembled from several neural modules, where each module is meant to perform a particular subtask of the input processing, much like a computer program composed of functions. The NMN approach is intuitively appealing but its widespread adoption has been hindered by the large amount of domain knowledge that is required to decide BIBREF12 or predict BIBREF14 , BIBREF15 how the modules should be created (parametrization) and how they should be connected (layout) based on a natural language utterance. Besides, their performance has often been matched by more traditional neural models, such as FiLM BIBREF16 , Relations Networks BIBREF17 , and MAC networks BIBREF18 . Lastly, generalization properties of NMNs, to the best of our knowledge, have not been rigorously studied prior to this work.Here, we investigate the impact of explicit modularity and structure on systematic generalization of NMNs and contrast their generalization abilities to those of generic models. For this case study, we focus on the task of visual question answering (VQA), in particular its simplest binary form, when the answer is either “yes” or “no”. Such a binary VQA task can be seen as a fundamental task of language understanding, as it requires one to evaluate the truth value of the utterance with respect to the state of the world. Among many systematic generalization requirements that are desirable for a VQA model, we choose the following basic one: a good model should be able to reason about all possible object combinations despite being trained on a very small subset of them. We believe that this is a key prerequisite to using VQA models in the real world, because they should be robust at handling unlikely combinations of objects. We implement our generalization demands in the form of a new synthetic dataset, called Spatial Queries On Object Pairs ( $\operatorname{SQOOP}$ ), in which a model has to perform basic spatial relational reasoning about pairs of randomly scattered letters and digits in the image (e.g. answering the question “Is there a letter A left of a letter B?”). The main challenge in $\operatorname{SQOOP}$ is that models are evaluated on all possible object pairs, but trained on only a subset of them.Our first finding is that NMNs do generalize better than other neural models when layout and parametrization are chosen appropriately. We then investigate which factors contribute to improved generalization performance and find that using a layout that matches the task (i.e. a tree layout, as opposed to a chain layout), is crucial for solving the hardest version of our dataset. Lastly, and perhaps most importantly, we experiment with existing methods for making NMNs more end-to-end by inducing the module layout BIBREF14 or learning module parametrization through soft-attention over the question BIBREF15 . Our experiments show that such end-to-end approaches often fail by not converging to tree layouts or by learning a blurred parameterization for modules, which results in poor generalization on the hardest version of our dataset. We believe that our findings challenge the intuition of researchers in the field and provide a foundation for improving systematic generalization of neural approaches to language understanding.We perform all experiments of this study on the $\operatorname{SQOOP}$ dataset. $\operatorname{SQOOP}$ is a minimalistic VQA task that is designed to test the model's ability to interpret unseen combinations of known relation and object words. Clearly, given known objects $\operatorname{X}$ , $\operatorname{Y}$ and a known relation $\operatorname{R}$ , a human can easily verify whether or not the objects $\operatorname{X}$ and $\operatorname{Y}$ are in relation $\operatorname{R}$ . Some instances of such queries are common in daily life (is there a cup on the table), some are extremely rare (is there a violin under the car), and some are unlikely but have similar, more likely counter-parts (is there grass on the frisbee vs is there a frisbee on the grass). Still, a person can easily answer these questions by understanding them as just the composition of the three separate concepts. Such compositional reasoning skills are clearly necessary for language understanding models, and $\operatorname{SQOOP}$ is explicitly designed to test for them.Concretely speaking, $\operatorname{SQOOP}$ requires observing a 64 $\times $ 64 RGB image $\operatorname{x}$ and answering a yes-no question $q = \operatorname{X}\operatorname{R}\operatorname{Y}$ about whether objects $\operatorname{X}$ and $\operatorname{Y}$ are in a spatial relation $\operatorname{R}$ . The questions are represented in a redundancy-free $\operatorname{X}$ $\operatorname{R}$ $\operatorname{Y}$ form; we did not aim to make the questions look like natural language. Each image contains 5 randomly chosen and randomly positioned objects. There are 36 objects: the latin letters A-Z and digits 0-9, and there are 4 relations: left_of, right_of, above, and below. This results in $\times $0 possible unique questions (we do not allow questions about identical objects). To make negative examples challenging, we ensure that both $\times $1 and $\times $2 of a question are always present in the associated image and that there are always distractor objects $\times $3 and $\times $4 such that $\times $5 and $\times $6 are both true for the image. These extra precautions guarantee that answering a question requires the model to locate all possible $\times $7 and $\times $8 then check if any pair of them are in the relation R. Two $\times $9 examples are shown in Figure 1 .Our goal is to discover which models can correctly answer questions about all $36 \cdot 35$ possible object pairs in $\operatorname{SQOOP}$ after having been trained on only a subset. For this purpose we build training sets containing $36 \cdot 4 \cdot k$ unique questions by sampling $k$ different right-hand-side (RHS) objects $\operatorname{Y}$ 1, $\operatorname{Y}$ 2, ..., $\operatorname{Y}$ k for each left-hand-side (LHS) object $\operatorname{X}$ . We use this procedure instead of just uniformly sampling object pairs in order to ensure that each object appears in at least one training question, thereby keeping the all versions of the dataset solvable. We will refer to $k$ as the #rhs/lhs parameter of the dataset. Our test set is composed from the remaining $36 \cdot 4 \cdot (35-k)$ questions. We generate training and test sets for rhs/lhs values of 1,2,4,8 and 18, as well as a control version of the dataset, #rhs/lhs=35, in which both the training and the test set contain all the questions (with different images). Note that lower #rhs/lhs versions are harder for generalization due to the presence of spurious correlations between lhs and rhs objects that which the models may adapt. In the extreme case of #rhs/lhs=1, a model may learn to predict the rhs object from the lhs. In order to exclude a possible compounding factor of overfitting on the training images, all our training sets contain 1 million examples, so for a dataset with #rhs/lhs = $\operatorname{SQOOP}$0 we generate approximately $\operatorname{SQOOP}$1 different images per question. Pseudocode for generating $\operatorname{SQOOP}$2 can be found in Appendix "SQOOP\operatorname{SQOOP} Pseudocode" .A great variety of VQA models have been recently proposed in the literature, among which we can distinguish two trends. Some of the recently proposed models, such as FiLM BIBREF16 and Relation Networks (RelNet, BIBREF17 ) are highly generic and do not require any task-specific knowledge to be applied on a new dataset. On the opposite end of the spectrum are modular and structured models, typically flavours of Neural Module Networks BIBREF12 , that require some knowledge about the task at hand to be instantiated. Here, we evaluate systematic generalization of several state-of-the-art models in both families. In all models, the image $\operatorname{x}$ is first fed through a CNN based network, that we refer to as the stem, to produce a feature-level 3D tensor $h_{\operatorname{x}}$ . This is passed through a model-specific computation conditioned on the question $q$ , to produce a joint representation $h_{q\operatorname{x}}$ . Lastly, this representation is fed into a fully-connected classifier network to produce logits for prediction. Therefore, the main difference between the models we consider is how the computation $h_{q\operatorname{x}} = model(h_{\operatorname{x}}, q)$ is performed.We consider four generic models in this paper: CNN+LSTM, FiLM, Relation Network (RelNet), and Memory-Attention-Control (MAC) network. For CNN+LSTM, FiLM, and RelNet models, the question $q$ is first encoded into a fixed-size representation $h_{q}$ using a unidirectional LSTM network.CNN+LSTM flattens the 3D tensor $h_{\operatorname{x}}$ to a vector and concatenates it with $h_{q}$ to produce $h_{q\operatorname{x}}$ . $$h_{q\operatorname{x}} = [vec(h_{\operatorname{x}}) ; h_{q}]$$   (Eq. 3) RelNet BIBREF17 uses a network $g$ which is applied to all pairs of feature columns of $h_\operatorname{x}$ concatenated with the question representation $h_q$ , all of which is then pooled to obtain $h_{q\operatorname{x}}$ : hqx=i,j g(hx(i), hx(j), hq) where $h_x(i)$ is the $i$ -th feature column of $h_x$ . FiLM networks BIBREF16 use $N$ convolutional FiLM blocks applied to $h_\operatorname{x}$ . A FiLM block is a residual block BIBREF19 in which a feature-wise affine transformation (FiLM layer) is inserted after the 2 convolutional layer. The FiLM layer is conditioned on the question at hand via prediction of the scaling and shifting parameters $\gamma _n$ and $h_\operatorname{x}$0 : [n; n ] = Wnq hq + bnqhqxn = BN(Wn2 * ReLU(Wn1 * hqxn-1 + bn))hnqx = hqxn-1 + ReLU(n hqxn n) where $BN$ stands for batch normalization, $*$ stands for convolution and $\odot $ stands for element-wise multiplications. $h^n_{q\operatorname{x}}$ is the output of the $n$ -th FiLM block and $h^0_{q\operatorname{x}} = h_{\operatorname{x}}$ . The output of the last FiLM block $h_{q\operatorname{x}}^N$ undergoes an extra 1 $\times $ 1 convolution and max-pooling to produce $h_{q\operatorname{x}}$ . MAC network of BIBREF18 produces $h_{q\operatorname{x}}$ by repeatedly applying a Memory-Attention-Composition (MAC) cell that is conditioned on the question through an attention mechanism. The MAC model is quite complex and we refer the reader to the original paper for details.Neural Module Networks (NMN) BIBREF12 are an elegant solution that constructs a question-specific network by composing together trainable neural modules, drawing inspiration from symbolic approaches to question answering BIBREF20 . To answer a question with an NMN, one first constructs the computation graph by making the following decisions: (a) how many modules and of which types will be used, (b) how will the modules be connected to each other, and (c) how are these modules parametrized based on the question. We refer to the aspects (a) and (b) of the computation graph as the layout and the aspect (c) as the parametrization. In the original NMN and in many follow-up works, different module types are used to perform very different computations, e.g. the Find module from BIBREF15 performs trainable convolutions on the input attention map, whereas the And module from the same paper computes an element-wise maximum for two input attention maps. In this work, we follow the trend of using more homogeneous modules started by BIBREF14 , who use only two types of modules: unary and binary, both performing similar computations. We go one step further and retain a single binary module type, using a zero tensor for the second input when only one input is available. Additionally, we choose to use exactly three modules, which simplifies the layout decision to just determining how the modules are connected. Our preliminary experiments have shown that, even after these simplifications, NMNs are far ahead of other models in terms of generalization.In the original NMN, the layout and parametrization were set in an ad-hoc manner for each question by analyzing a dependency parse. In the follow-up works BIBREF14 , BIBREF15 , these aspects of the computation are predicted by learnable mechanisms with the goal of reducing the amount of background knowledge required to apply the NMN approach to a new task. We experiment with the End-to-end NMN (N2NMN) BIBREF15 paradigm from this family, which predicts the layout with a seq2seq model BIBREF9 and computes the parametrization of the modules using a soft attention mechanism. Since all the questions in $\operatorname{SQOOP}$ have the same structure, we do not employ a seq2seq model but instead have a trainable layout variable and trainable attention variables for each module.Formally, our NMN is constructed by repeatedly applying a generic neural module $f(\theta , \gamma , h_{l}, h_{r})$ , which takes as inputs the shared parameters $\theta $ , the question-specific parametrization $\gamma $ and the left-hand side and right-hand side inputs $h_{l}$ and $h_{r}$ . $M$ such modules are connected and conditioned on a question $q=(q_1, q_2, q_3)$ as follows: k = i=1s k, i e(qi)hk = f( , k, j=-1k-1 k, j0 hj, j=-1k-1 k, j1 hj)hqx = hMIn the equations above, $h_{-1} = 0$ is the zero tensor input, $h_0 = h_x$ are the image features outputted by the stem, and $e$ is the embedding table for the questions words, and we refer to $A=(\alpha ^{k,i}) $ and $T=(\tau ^{k,i}_{0}, \tau ^{k,i}_{1})$ as the parametrization attention matrix and the layout tensor respectively.We experiment with two choices for the NMN's generic neural module: the $\operatorname{Find}$ module from BIBREF15 and the $\operatorname{Residual}$ module from BIBREF14 with very minor modifications — we use 64 dimensional CNNs in our $\operatorname{Residual}$ blocks since our dataset consists of 64 $\times $ 64 images. The equations for the $\operatorname{Residual}$ module are as follows: = ,= [ W1; b1; W2; b2; W3; b3],h = ReLU(W3 * [hl; hr] + b3),fResidual(, hl, hr) = ReLU(h + W1 * ReLU(W2 * h + b2)) + b1), and for $\operatorname{Find}$ module as follows: = [ W1; b1; W2; b2],fFind (, hl, hr) = ReLU(W1 * ReLU(W2 * [hl; hr] + b2) + b1). In formulas above $W_1, W_2, W_3$ are convolution weights, and $b_1$ , $b_2$ , $b_3$ are biases. The main difference between $\operatorname{Residual}$ and $\operatorname{Find}$ is that in $\operatorname{Residual}$ all parameters depend on the questions words, where as in $\operatorname{Find}$ convolutional weights are the same for all questions, and only the element-wise multipliers $\gamma $ vary based on the question. We note that the specific $\operatorname{Find}$ module we use in this work is slightly different from the one used in BIBREF15 in that it outputs a feature tensor, not just an attention map. This change was required in order to connect multiple $b_1$0 modules in the same way as we connect multiple residual ones.Based on the generic NMN model described above, we experiment with several specific architectures as shown in Figure 1 . Each of the models uses $M=3$ modules, which are connected and parametrized differently. In NMN-Chain modules form a sequential chain. Modules 1, 2 and 3 are parametrized based on the first object word, second object word and the relation word respectively, which is achieved by setting the attention $\alpha _1$ , $\alpha _2$ , $\alpha _3$ to the corresponding one-hot vectors. We also experiment with giving the image features $h_{x}$ as the right-hand side input to all 3 modules and call the resulting model NMN-Chain-Shortcut. NMN-Tree is similar to NMN-Chain in that the attention vectors are similarly hard-coded, but we change the connectivity between the modules to be tree-like. Stochastic N2NMN follows the N2NMN approach by BIBREF15 for inducting layout. We treat the layout $T$ as a stochastic latent variable. $T$ is allowed to take two values: $T_{tree}$ as in NMN-Tree, and $T_{chain}$ as in NMN-Chain. We calculate the output probabilities by marginalizing out the layout i.e. probability of answer being “yes” is computed as $p(\textrm {yes}|x,q) = \sum _{T \in \left\lbrace T_{tree}, T_{chain}\right\rbrace } p(\textrm {yes}|T,x,q)p(T)$ . Lastly, Attention N2NMN uses the N2NMN method for learning parametrization BIBREF15 . It is structured just like NMN-Tree but has $\alpha _1$0 computed as $\alpha _1$1 , where $\alpha _1$2 is a trainable vector. We use Attention N2NMN only with the $\alpha _1$3 module because using it with the $\alpha _1$4 module would involve a highly non-standard interpolation between convolutional weights.In our experiments we aimed to: (a) understand which models are capable of exhibiting systematic generalization as required by $\operatorname{SQOOP}$ , and (b) understand whether it is possible to induce, in an end-to-end way, the successful architectural decisions that lead to systematic generalization.All models share the same stem architecture which consists of 6 layers of convolution (8 for Relation Networks), batch normalization and max pooling. The input to the stem is a 64 $\times $ 64 $\times $ 3 image, and the feature dimension used throughout the stem is 64. Further details can be found in Appendix "Experiment Details" . The code for all experiments will be released in the near future.We report the performance for all models on datasets of varying difficulty in Figure 2 . Our first observation is that the modular and tree-structured NMN-Tree model exhibits strong systematic generalization. Both versions of this model, with $\operatorname{Residual}$ and $\operatorname{Find}$ modules, robustly solve all versions of our dataset, including the most challenging #rhs/lhs=1 split.The results of NMN-Tree should be contrasted with those of generic models. 2 out of 4 models (Conv+LSTM and RelNet) are not able to learn to answer all $\operatorname{SQOOP}$ questions, no matter how easy the split was (for high #rhs/lhs Conv+LSTM overfitted and RelNet did not train). The results of other two models, MAC and FiLM, are similar. Both models are clearly able to solve the $\operatorname{SQOOP}$ task, as suggested by their almost perfect $< 1\%$ error rate on the control #rhs/lhs=35 split, yet they struggle to generalize on splits with lower #rhs/lhs. In particular, we observe $13.67 \pm 9.97\%$ errors for MAC and a $34.73 \pm 4.61\%$ errors for FiLM on the hardest #rhs/lhs=1 split. For the splits of intermediate difficulty we saw the error rates of both models decreasing as we increased the #rhs/lhs ratio from 2 to 18. Interestingly, even with 18 #rhs/lhs some MAC and FiLM runs result in a test error rate of $\sim $ $2\%$ . Given the simplicity and minimalism of $\operatorname{SQOOP}$ questions, we believe that these results should be considered a failure to pass the $\operatorname{SQOOP}$ test for both MAC and FiLM. That said, we note a difference in how exactly FiLM and MAC fail on #rhs/lhs=1: in several runs (3 out of 15) MAC exhibits a strong generalization performance ( $\sim 0.5\%$ error rate), whereas in all runs of FiLM the error rate is about $\operatorname{SQOOP}$0 . We examine the successful MAC models and find they have converged to a successful setting of the control attention weights, that is the weights with which MAC units attend to questions words. In particular, MAC models that generalize strongly for each question would have a unit focusing strongly on $\operatorname{SQOOP}$1 and a unit focusing strongly on $\operatorname{SQOOP}$2 . (see Appendix "Additional Results for MAC Model" for more details). As MAC was the strongest competitor of NMN-Tree across generic models, we have performed an ablation study for this model, in which we varied the number of modules and hidden units, as well as experimented with weight decay. These modifications have not resulted in any significant reduction of the gap between MAC and NMN-Tree. Interestingly, we found that using the default high number of MAC units, namely 12, was helpful, possibly it made it more likely that some units are initialized to focus on $\operatorname{SQOOP}$3 and $\operatorname{SQOOP}$4 words (see Appendix "Additional Results for MAC Model" for details).The superior generalization performance of NMN-Tree raises the following question: what is the key architectural difference between NMN-Tree and generic models that explains the performance gap between them? We consider two candidate explanations. First, the NMN-Tree model differs from the generic models in that it does not use a language encoder and is instead built from modules that are parametrized by question words directly. Second, NMN-Tree is structured in a particular way, with the idea that modules 1 and 2 may learn to locate objects and module 3 can learn to reason about object locations independently of their identities. To understand which of the two differences is responsible for the superior generalization, we compare the performance of the NMN-Tree, NMN-Chain and NMN-Chain-Shortcut models (see Figure 1 ). These 3 versions of NMN are similar is that none of them are using a language encoder, but they differ in how the modules are connected. The results in Figure 2 show that for both $\operatorname{Find}$ and $\operatorname{Residual}$ module architectures, using a tree layout is absolutely crucial (and sufficient) for generalization, meaning that the generalization gap between NMN-Tree and generic models can not be explained merely by the language encoding step in the latter. In particular, NMN-Chain models perform barely above random chance, doing even worse than generic models on the #rhs/lhs=1 version of the dataset and dramatically failing even on the easiest #rhs/lhs=18 split. This is in stark contrast with NMN-Tree models that exhibits nearly perfect performance on the hardest #rhs/lhs=1 split. As a sanity check we trained NMN-Chain models on the vanilla #rhs/lhs=35 split. We found that NMN-Chain model has little difficulty to learn to answer $\operatorname{SQOOP}$ questions when it sees all of them at training time, even though it shows very poor generalization in our other experiments. Interestingly, NMN-Chain-Shortcut performed much better than NMN-Chain and quite similarly to generic models. We find it remarkable that such a slight change in the model layout as adding the shortcut connections from image features $h_x$ to the chain modules results in a drastic change in generalization performance. In an attempt to understand why NMN-Chain generalizes so poorly we compared the test set responses of the 5 NMN-Chain models trained on #rhs/lhs=1 split. Notably, there was very little agreement between predictions of these 5 runs (Fleiss $\kappa = 0.05$ ), suggesting that NMN-Chain performs rather randomly outside of the training set.The strong generalization of the NMN-Tree model is impressive, but a significant amount of prior knowledge about the task was required to come up with the successful layout and parametrization used in this model. We therefore investigate whether the amount of such prior knowledge can be reduced by fixing one of these structural aspects and inducing another.In our layout induction experiments, we use the Stochastic N2NMN model which treats the layout as a stochastic latent variable with two values ( $T_{tree}$ and $T_{chain}$ , see Section "Experiments" for details). We experiment with N2NMNs using both $\operatorname{Find}$ and $\operatorname{Residual}$ modules and report results with different initial conditions, $p_0(tree) \in {0.1, 0.5, 0.9}$ . We believe that the initial probability $p_0(tree)=0.1$ should not be considered small, as in more challenging datasets the space of layouts would be exponentially large, and sampling the right layout in 10% of all cases could be considered a very lucky initialization. We repeat all experiments on #rhs/lhs=1 and on #rhs/lhs=18 splits, the former to study generalization, and the latter to control whether the failures on #rhs/lhs=1 are caused specifically by the difficulty of this split. The results (see Table 1 ) show that the success of layout induction (i.e. converging to a $p(tree)$ close to $0.9$ ) depends in a complex way on all the factors that we considered in our experiments. The initialization has the most influence: models initialized with $p_0(tree)=0.1$ typically do not converge to a tree (exception being experiments with $\operatorname{Residual}$ module on #rhs/lhs=18, in which 3 out of 5 runs converged to a solution with a high $T_{chain}$0 ). Likewise, models initialized with $T_{chain}$1 always stay in a regime with a high $T_{chain}$2 . In the intermediate setting of $T_{chain}$3 we observe differences in behaviors for $T_{chain}$4 and $T_{chain}$5 modules. In particular, N2NMN based on $T_{chain}$6 modules stays spurious with $T_{chain}$7 when #rhs/lhs=1, whereas N2NMN based on $T_{chain}$8 modules always converges to a tree.One counterintuitive result in Table 1 is that Stochastic N2NMNs with $\operatorname{Residual}$ modules that were trained with $p_0(tree)=0.5$ and #rhs/lhs=1 make just $1.64 \pm 1.79\%$ errors on the generalization set despite being spurious mixtures between a tree and a chain. Our explanation for this phenomenon is as follows: when connected in a tree, modules of such spurious models generalize well, and when connected as a chain they generalize poorly. The output distribution of the whole model is thus a mixture of the mostly correct $p(y|T=T_{tree},x,q)$ and mostly random $p(y|T=T_{chain},x,q)$ . We verified our reasoning by explicitly evaluating test accuracies for $p(y|T=T_{tree},x,q)$ and $p(y|T=T_{chain},x,q)$ , and we found them to be around $99\%$ and $60\%$ respectively, confirming our hypothesis. As a result the predictions of the spurious models with $p(tree) \approx 0.5$ have lower confidence than those of sharp tree models, as indicated by the high log loss of $p_0(tree)=0.5$0 . We visualize the progress of structure induction for the $p_0(tree)=0.5$1 module with $p_0(tree)=0.5$2 in Figure 3 which shows how $p_0(tree)=0.5$3 saturates to 1.0 for #rhs/lhs=18 and remains around 0.5 when #rhs/lhs=1.Next, we experiment with the Attention N2NMN model (see Section "Experiments" ) in which the parametrization is learned for each module as an attention-weighted average of word embeddings. In these experiments, we fix the layout to be tree-like and sample the pre-softmax attention weights $\tilde{\alpha }$ from a uniform distribution $U[0;1]$ . As in the layout induction investigations, we experiment with several $\operatorname{SQOOP}$ splits, namely we try #rhs/lhs $\in \lbrace 1,2,18\rbrace $ . The results (reported in Table 2 ) show that Attention N2NMN fails dramatically on #rhs/lhs=1 but quickly catches up as soon as #rhs/lhs is increased to 2. Notably, 9 out of 10 runs on #rhs/lhs=2 resulted in almost perfect performance, and 1 run completely failed to generalize (26% error rate), resulting in a high $8.18\%$ variance of the mean error rate. All 10 runs on the split with 18 rhs/lhs generalized flawlessly. We furthermore inspected the learned attention weights and found that for typical successful runs, module 3 focuses on the relation word, whereas modules 1 and 2 focus on different object words (see Figure 3 ) while still focusing on the relation word. To better understand the relationship between successful layout induction and generalization, we define an attention quality metric $\kappa =\min _{w \in \lbrace X, Y\rbrace } \max _{k \in {1, 2}} \alpha _{k, w} / (1 - \alpha _{k, R})$ . Intuitively, $\kappa $ is large when for each word $w \in {X, Y}$ there is a module $i$ that focuses mostly on this word. The renormalization by $1/(1 - \alpha _{k,R})$ is necessary to factor out the amount of attention that modules 1 and 2 assign to the relation word. For the ground-truth parametrization that we use for NMN-Tree $U[0;1]$0 takes a value of 1, and if both modules 1 and 2 focus on X, completely ignoring Y, $U[0;1]$1 equals 0. The scatterplot of the test error rate versus $U[0;1]$2 (Figure 3 ) shows that for #rhs/lhs=1 high generalization is strongly associated with higher $U[0;1]$3 , meaning that it is indeed necessary to have different modules strongly focusing on different object words in order to generalize in this most challenging setting. Interestingly, for #rhs/lhs=2 we see a lot of cases where N2NMN generalizes well despite attention being rather spurious ( $U[0;1]$4 ).In order to put Attention N2NMN results in context we compare them to those of MAC (see Table 2 ). Such a comparison can be of interest because both models perform attention over the question. For 1 rhs/lhs MAC seems to be better on average, but as we increase #rhs/lhs to 2 we note that Attention N2NMN succeeds in 9 out of 10 cases on the #rhs/lhs=2 split, much more often than 1 success out of 10 observed for MAC. This result suggests that Attention N2NMNs retains some of the strong generalization potential of NMNs with hard-coded parametrization.The notion of systematicity was originally introduced by BIBREF11 as the property of human cognition whereby “the ability to entertain a given thought implies the ability to entertain thoughts with semantically related contents”. They illustrate this with an example that no English speaker can understand the phrase “John loves the girl” without being also able to understand the phrase “the girl loves John”. The question of whether or not connectionist models of cognition can account for the systematicity phenomenon has been a subject of a long debate in cognitive science BIBREF11 , BIBREF21 , BIBREF22 , BIBREF23 , BIBREF24 . Most recently BIBREF8 and BIBREF25 have shown that lack of systematicity in the generalization is still a concern for the modern seq2seq models. Our findings about the weak systematic generalization of generic VQA models corroborate the aforementioned seq2seq results. We also go beyond merely stating negative generalization results and showcase the high systematicity potential of adding explicit modularity and structure to modern deep learning models.Besides the theoretical appeal of systematicity, our study is inspired by highly related prior evidence that when trained on downstream language understanding tasks, neural networks often generalize poorly and latch on to dataset-specific regularities. BIBREF5 report how neural models exploit biases in a VQA dataset, e.g. responding “snow” to the question “what covers the ground” regardless of the image because “snow” is the most common answer to this question. BIBREF6 report that many successes in natural language entailment are actually due to exploiting statistical biases as opposed to solving entailment, and that state-of-the-art systems are much less performant when tested on unbiased data. BIBREF7 demonstrate that seemingly state-of-the-art reading comprehension system can be misled by simply appending an unrelated sentence that resembles the question to the document.Using synthetic VQA datasets to study grounded language understanding is a recent trend started by the CLEVR dataset BIBREF26 . CLEVR images are 3D-rendered and CLEVR questions are longer and more complex than ours, yet the color-shape generalization split that CLEVR includes arguably lacks a cleAnother source of inspiration for tar motivation. More closely related to our work is the ShapeWorld family of datasets by BIBREF27 , that involves a number of VQA generalization tests. ShapeWorld only contains 10 different objects, making it insufficient for our study. Most closely related to our work is the recent study of generalization to long-tail questions about rare objects done by BIBREF28 . They do not, however, consider as many models as we do and do not study the question of whether the best-performing models can be made end-to-end.The key paradigm that we test in our experiments is Neural Module Networks (NMN). BIBREF12 introduced NMNs as a modular, structured VQA model where a fixed number of hand-crafted neural modules (such as Find, or Compare) are chosen and composed together in a layout determined by the dependency parse of question. BIBREF15 and BIBREF14 followed up by making NMNs end-to-end, removing the non-differentiable parser. The former chose to keep the handcrafted modules and uses reinforcement learning to learn the layout and modules end-to-end. The latter used a ground truth module layout learned separately, and changes the hand-crafted modules for a generic ResNet block structure BIBREF19 for every module. Both BIBREF15 and BIBREF14 reported that several thousands of ground-truth layouts are required to pretrain the layout predictor in order for their approaches to work. In a recent work, BIBREF29 attempt to soften the layout decisions, but training their models end-to-end from scratch performed substantially lower than best models on the CLEVR task.We have conducted a rigorous investigation of an important form of systematic generalization required for grounded language understanding: the ability to reason about all possible pairs of objects despite being trained on a small subset. Our results allow one to draw two important conclusions. For one, the intuitive appeal of modularity and structure in designing neural architectures for language understanding is now supported by our results, which show how a modular model consisting of general purpose residual blocks generalizes much better than a number of baselines, including architectures such as MAC, FiLM and RelNet that were designed specifically for visual reasoning. While this may seem unsurprising, to the best of our knowledge, the literature has lacked such a clear empirical evidence in favor of modular and structured networks before this work. Importantly, we have also shown how sensitive the high performance of the modular models is to the layout of modules, and how a tree-like structure generalizes much stronger than a typical chain of layers.Our second key conclusion is that coming up with an end-to-end and/or soft version of modular models may be not sufficient for strong generalization. In the very setting where strong generalization is required, end-to-end methods often converge to a different, less compositional solution (e.g. a chain layout or blurred attention). This can be observed especially clearly in our NMN layout and parametrization induction experiments on the #rhs/lhs=1 version of $\operatorname{SQOOP}$ , but notably, strong initialization sensitivity of layout induction remains an issue even on the #rhs/lhs=18 split. This conclusion is relevant in the view of recent work in the direction of making NMNs more end-to-end BIBREF30 , BIBREF29 , BIBREF18 , BIBREF31 . Our findings suggest that merely replacing hard-coded components with learnable counterparts can be insufficient, and that research on regularizers or priors that steer the learning towards more systematic solutions can be required. That said, our parametrization induction results on the #rhs/lhs=2 split are encouraging, as they show that compared to generic models, a weaker nudge (in the form of a richer training signal or a prior) towards systematicity may suffice for end-to-end NMNs.While our investigation has been performed on a synthetic dataset, we believe that it is the real-world language understanding where our findings may be most relevant. It is possible to construct a synthetic dataset that is bias-free and that can only be solved if the model has understood the entirety of the dataset's language. It is, on the contrary, much harder to collect real-world datasets that do not permit highly dataset-specific solutions, as numerous dataset analysis papers of recent years have shown (see Section "Related Work" for a review). We believe that approaches that can generalize strongly from imperfect and biased data will likely be required, and our experiments can be seen as a simulation of such a scenario. We hope, therefore, that our findings will inform researchers working on language understanding and provide them with a useful intuition about what facilitates strong generalization and what is likely to inhibit it.We thank Maxime Chevalier-Boisvert and Yoshua Bengio for useful discussions. This research was enabled in part by support provided by Compute Canada (www.computecanada.ca), NSERC and Canada Research Chairs. We also thank Nvidia for donating NVIDIA DGX-1 used for this research.We trained all models by minimizing the cross entropy loss $\log p(y|x, q)$ on the training set, where $y \in \lbrace \textrm {yes}, \textrm {no}\rbrace $ is the correct answer, $x$ is the image, $q$ is the question. In all our experiments we used the Adam optimizer BIBREF32 with hyperparameters $\alpha =0.0001$ , $\beta _1=0.9$ , $\beta _2=0.999$ , $\epsilon =10^{-10}$ . We continuously monitored validation set performance of all models during training, selected the best one and reported its performance on the test set. The number of training iterations for each model was selected in preliminary investigations based on our observations of how long it takes for different models to converge. This information, as well as other training details, can be found in Table 3 .We performed an ablation study in which we varied the number of MAC units, the model dimensionality and the level of weight decay for the MAC model. The results can be found in Table 4 .We also perform qualitative investigations to understand the high variance in MAC's performance. In particular, we focus on control attention weights ( $c$ ) for each run and aim to understand if runs that generalize have clear differences when compared to runs that failed. Interestingly, we observe that in successful runs each word $w \in {\operatorname{X}, \operatorname{Y}}$ has a unit that is strongly focused on it. To present our observations in quantitative terms, we plot attention quality $\kappa =\min _{w \in \lbrace X, Y\rbrace } \max _{k \in [1; 12]} \alpha _{k, w} / (1 - \alpha _{k, R})$ , where $\alpha $ are control scores vs accuracy in Figure 4 for each run (see Section UID12 for an explanation of $\kappa $ ). We can clearly see a strong positive correlation between $\kappa $ and error rate.Next, we experiment with a hard-coded variation of MAC. In this model, we use hard-coded control scores such that given a $\operatorname{SQOOP}$ question $\operatorname{X}\operatorname{R}\operatorname{Y}$ , the first half of all modules focuses on $\operatorname{X}$ while the second half focuses on $\operatorname{Y}$ . The relationship between MAC and hardcoded MAC is similar to that between NMN-Tree and end-to-end NMN with parameterization induction. However, this model has not performed as well as the successful runs of MAC. We hypothesize that this could be due to the interactions between the control scores and the visual attention part of the model.[h] Pseudocode for creating $\operatorname{SQOOP}$ [1] $S$ $\leftarrow $ {A,B,C, ..., Z, 0,1,2,3, ..., 9} $Rel$ $\leftarrow $ {left-of, right-of, above, below } relations CreateSQOOPk $TrainQuestions$ $\leftarrow $ [] $AllQuestions$ $\leftarrow $ [] $X$ in $S$ $AllRhs$ $\leftarrow $ RandomSample( $S\setminus X$ , k) sample without replacement from $S \setminus X$ $AllQuestions$ $\leftarrow $ $[X] \times Rel \times (S\setminus X) \cup AllQuestions$  $R,Y$ in $AllRhs \times Rel$ $TrainQuestions$ $\leftarrow $ $(X,R,Y) \cup TrainQuestions$ $TestQuestions$ $\leftarrow $ $AllQuestions\setminus TrainQuestions$ GenerateExample $X,R,Y$ $a$ $AllRhs \times Rel$0 {Yes, No} $AllRhs \times Rel$1 $AllRhs \times Rel$2 $AllRhs \times Rel$3 place $AllRhs \times Rel$4 and $AllRhs \times Rel$5 objects so that $AllRhs \times Rel$6 holds create the image $AllRhs \times Rel$7 $AllRhs \times Rel$8 sample 3 objects from $AllRhs \times Rel$9 and add to $TrainQuestions$0 $TrainQuestions$1 $TrainQuestions$2 Sample $TrainQuestions$3 from $TrainQuestions$4 $TrainQuestions$5 $TrainQuestions$6 Sample $TrainQuestions$7 from $TrainQuestions$8 $TrainQuestions$9 $\leftarrow $0 place $\leftarrow $1 and $\leftarrow $2 objects so that $\leftarrow $3 holds create the image $\leftarrow $4 $\leftarrow $5 add $\leftarrow $6 and $\leftarrow $7 objects to $\leftarrow $8 so that $\leftarrow $9 holds $(X,R,Y) \cup TrainQuestions$0 $(X,R,Y) \cup TrainQuestions$1 sample 1 more object from $(X,R,Y) \cup TrainQuestions$2 and add to $(X,R,Y) \cup TrainQuestions$3 $(X,R,Y) \cup TrainQuestions$4 and $(X,R,Y) \cup TrainQuestions$5 are not in relation $(X,R,Y) \cup TrainQuestions$6 in I $I$ , $X,R,Y$ , $a$ $Train$ $\leftarrow $ sample $\frac{10^6}{|TrainQuestions|}$ examples for each (X,R,Y) $\in $ $TrainQuestions$ from GenerateExample $X,R,Y$ $Test$ $X,R,Y$0 sample 10 examples for each (X,R,Y) $X,R,Y$1 $X,R,Y$2 from GenerateExample $X,R,Y$3

Q: What is grounded language understanding?