- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces SPACE-LLM, which reads distributions over program arguments from intermediate LLM/VLM hidden states and executes a fixed symbolic program as tensor operations inside the forward pass. Answer supervision trains the reader through analytic gradients, and a learned result token allows the upper model layers to verbalize the output. Across two backbones and five benchmarks, the approach learns effectively on CLUTRR, CUB-200, and Super-CLEVR, but fails on GSM8K and SATBench. The paper compares soft and committed readouts, SFT and GRPO, training time, probabilistic scores, and several architectural and inference controls. Its main contribution is a concrete account of when internal differentiable execution provides efficient answer-supervised learning.
Critical strengths
1. Sound methodology. The paper presents a coherent approach to answer-supervised tool integration.
2. Extensive experiments. The paper includes comprehensive evaluations and controls to support its findings.
Critical weaknesses
-
Limited novelty. Probabilistic neurosymbolic inference and end-to-end learning from answer supervision have been explored in DeepProbLog (NeurIPS 18) and Scallop (PLDI 23), while Neural Comprehension / CoNN (ICLR 24) already integrates compiled symbolic modules into language models. SPACE’s contribution therefore appears primarily architectural, but its incremental benefit over these established designs remains insufficiently isolated. The Soft/Commit controls support retaining uncertainty, yet do not establish the specific advantage of executing programs inside the LLM and injecting their results into its residual stream. The authors should clarify this distinction and compare against an LLM encoder connected to an existing differentiable probabilistic reasoner under matched supervision and training budgets.
-
Unreliable method. Answer-only supervision rewards incorrect arguments whenever they produce the correct answer. This risk is evident in CUB-200, where learned attribute accuracy does not exceed the majority baseline despite strong final classification. Thus, successful predictions do not establish semantically faithful tool arguments.
-
Lack theoretical justification. The only formal guarantee is a standard Bayes-optimality result assuming correct argument distributions and exact marginalization, conditions not established for the evaluated models. It does not guarantee that answer-only training learns faithful arguments or produces calibrated predictions.
-
Limited related-work discussion. The brief coverage of related work makes it difficult for readers to understand the broader research context and distinguish the proposed approach from existing methods.
Questions for authors
-
What benefits specifically arise from in-model execution and residual-stream result injection compared with an LLM encoder connected to an existing differentiable probabilistic reasoner under matched supervision and training budgets?
-
How can answer-only supervision distinguish faithful arguments from incorrect arguments yielding the same answer, particularly given the near-majority-baseline attribute accuracy on CUB-200? What supports calibration when argument beliefs are inaccurate or marginalization is approximate?
-
Could the authors expand the related-work discussion and clarify SPACE’s methodological differences from DeepProbLog, Scallop, and Neural Comprehension / CoNN?
Thank you for pressing on what answer-only training can identify. That question became Proposition 2, which now explains both of the paper's failures.
Limited novelty
We agree that SPACE shares the learning principle of these methods. The submission cited all three in Section 2 but did not state the difference, and it now does (p. 2, l. 107): "SPACE shares the learning principle of these methods: neural predictions enter a probabilistic program, and the marginal likelihood of the answer trains them." The difference is where the program runs. Those systems run the program in a separate symbolic engine, while SPACE compiles it into a pretrained VLM's forward pass and writes the result back, so that the model states it. CoNN does place a compiled module inside a language model, but it joins the two outputs with an argmax (their Eq. 1) and trains by standard SFT, so no gradient passes through the tool.
Q1, in-model execution
The accuracy gains come from the analytic gradient through the program. In-model execution adds no accuracy of its own, and we do not claim that it does. An LLM encoder feeding an exact differentiable reasoner, as DSR-LM does, computes the same distribution and the same gradient as SPACE, so we did not run it separately. In-model execution adds two practical things: one GPU pass with no external call, and a result the model says in its own words. To isolate the gradient, as you asked, we fixed the adapter, program, rules and priors and changed only the training signal. Sampled rewards lose to the exact gradient in distribution on all four dataset and backbone pairs, and out of distribution on three, with a tie on the fourth (Appendix C.3, Table 11, p. 25).
Unreliable method
Correct. Answers alone cannot fix every argument, because a wrong reading can reach the right answer by coincidence. Proposition 2 now states this (p. 4, l. 206-209): "answer-only training cannot prefer the true reading over another reading with the same answers." On CLUTRR the answers mostly fix the arguments, and edges trained from answers reach 0.904 / 0.869 OOD beside 0.910 / 0.891 for SFT on edge labels. On GSM8K many readings give the same answer, and SPACE reaches only 11.1% to 15.5% even with the wiring given (Appendix H, p. 41).
CUB-200 attributes
True, and we make no claim that the attributes are literal. SPACE's attributes agree with the per-image annotations at 0.355 / 0.359, near the 0.376 of always picking the most common value (Appendix F, p. 36). The annotations are hard for any method to match. The most common value for an image's own species matches that image's annotation only 57.3% of the time, and SFT trained directly on the annotations matches them at 0.511 / 0.487. SPACE's attributes work as a code for the species, and naming the species is the task. There SPACE scores 0.864 / 0.818 against SFT's 0.447 / 0.409.
Calibration
Calibration is learned together with the beliefs, from the same answer loss. That loss is a proper scoring rule, so at its optimum the answer probabilities are calibrated whether or not the arguments are literal (Proposition 1, p. 4, l. 200). We concede that calibration still depends on the beliefs. The answer probabilities are computed from them, and the proposition gives no guarantee short of the optimum. Under approximation, Super-CLEVR leaves out a median of 2.1% / 4.2% of the probability mass and never renormalizes, so its confidence can only be too low. Moving all of that mass onto the predicted answer changes ECE by 0.03 at most (Appendix G.1, p. 39).
Theory
Section 3.1 now carries the two propositions above, with proofs in Appendix N (p. 52).
Related work
Section 2 is more detailed (p. 2, l. 107, to p. 3, l. 132), and a new Appendix L (p. 47) sets SPACE beside DeepProbLog, Scallop, DSR-LM and A-NeSI, beside RASP, Tracr and CoNN, and beside tool use by generation and reinforcement learning (PAL, Toolformer, ViperGPT).