Summary
This paper introduces Neuro-FOL, a method combining a large language model for generating FOL programs, an FOL executor and trainable concept grounding modules to improve performance on a number of visual/3D QA style tasks.
In the method, a LLM interpretor is used to generate a FOL program that is not specific or grounded to the exact domain. A differentiable first-order logic executor is then used to hierarchically evaluate the value of the program by using learnable, domain-specific grounding modules to ground the program in the specific domain.
The paper evaluates in 4 settings: 2D question answering, 3D referring expressions, temporal sequence reasoning and robotic manipulation. The method performs similarly to both NS and end-to-end methods in the normal data settings shown in Table 2, beats end-to-end methods in low data settings (Table 4). The paper also shows good performance on a set of held-out CLEVR tasks.
Strengths
I think main idea of the paper is really clever and well motivated. I think using a pre-trained LLM to do the logical breakdown of the query by generating a program, which can then be differentially trained is really smart. It gives you a way to have both the generality you get from LLMs having seen many concepts and the flexibility of adapting to a new domain.
The wide variety of domains and datasets evaluated is really good. Shows that the method works across a wide variety of different domains.
Shows really good performance compared to end-to-end methods in the rare data case, which is good.
Paper is pretty clearly presented and motivated.
Weaknesses
I think the claim of it being a universal language for all domains and therefore generally applicable across domains is maybe misleading and not totally supported. I think I agree that you could generate a program for pretty much any query-based problem, but it sort of missing a critical assumption, that the method has sufficient data to train each of the domain-specific module that you would generate. And of course, if during evaluation, if the program generated a module that it hadn't seen during training, it would fail. I think this is a real limitation of the method that should be more clearly mentioned in the paper.
Related to the above point, the set of domains is somewhat limited, and especially the kinds of reasoning here are pretty narrow. For instance, the 2D question answering is all done on CLEVR where the visually domain is extremely limited (only a set number of different block objects in a set number of colors) and a rather limited space of kinds of questions (questions chaining together reasoning about objects color, relative position, count etc). There are for instance many kinds of questions about images (for instance in the VQA dataset) that might not really have good coverage in the training set to work. If you had to train a new MLP classifier for each kind of attribute, object class and relation you might find in VQA, it's not totally obvious to me that this method would have enough data to actually work. SR3D is definitely more visually diverse in the number of object types, but the question types are also quite limited to these kinds of spatial reasoning questions. Similarly, robotic manipulation is more visually diverse and in the number of objects, but also suffers from a lack of diversity in the kinds of queries it needs to perform.
I get that the advantage of this method over pure NS approaches is that you do not need to manually define a domain-specific language, but the comparisons don't really any improvement over them. The claims about universality would be stronger if the domains were less constrained, showing for instance that this method can deal with unusual domain groundings in a way that would be hard to anticipate for a designer for NS methods.
Kind of a minor point, but I think the point on line 105 about VLMs not working on different domains such as 3D scenes and motion sequences is pedantic. Models not trained on 3D scenes and motion sequences of course don't generalize to these, but one could train a network on these domains as well. For instance: Gato (S Reed 2022) is trained on multiple kinds of modalities.
"Flamingo" in Table 6 should REALLY be stated to be Open-Flamingo. This is especially confusing since the paper uses the citation when it names the method. But it's not using the Flamingo model, it's using an open-source alternative to the model not Flamingo itself, which is very confusing/misleading.
A couple of unanswered questions I had (see below).
Questions
In Table 6, is Neuro-FOL trained on the regular CLEVR task before being put in the held-out CLEVR tasks? What about [Open] Flamingo?
In general, could you more clearly state in the paper the training loop for Neuro-FOL. I sort of infer that it is trained end-to-end on the target tasks, but that the only parts of the network that are actually updated are the domain specific grounding modules? Is that correct?
How does your method respond to very rate concepts, if you need to finetune an MLP for every grounding function. Do you see cases where a concept has very few examples during training and that module performs poorly?
How often does the LLM fail to provide a valid program and how often does it fail to provide a correct program? Does an invalid program result in Neuro-FOL failing to run?
If the program is incorrect during training, does this hurt performance in eval?
How robust is the method in general to program failures?
In general, what are the failure cases of this method?
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.
Limitations
I don't think that the paper does much to address the limitations of their methodology (see above) which I think would add a lot of value to the paper.