- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper demonstrates that a small, modality-decoupled recursive reasoner can serve as a latent scratchpad for a frozen image diffusion model, substantially improving exact constraint satisfaction without requiring an explicit symbolic decomposition, verifier, or task-specific solver. Rather than running recursive thinking steps in the complex and costly latent space of the diffusion model, the additional reasoner acts on a much smaller latent space. Experiments demonstrate the working of the approach on 3 different visual tasks.
Critical strengths
Although there have been very similar concepts in literature (see weaknesses below), the implementation in this paper is particularly simple but still effective. It is interesting to see that the diffusion model can be frozen and that they need not train a shared encoder.
In comparison to previous symbolic approaches, the method does not require additional components like solvers, verifiers, or symbolic intermediate targets, which hamper general applicability on image tasks. This strength is not entirely unique (see weaknesses), but very recent.
The results across four quite different visual constraint settings are convincing. I also liked the mechanistic experiments demonstrating the advantage of an uncommitted latent scratchpad.
Critical weaknesses
The paper should mention Latent Imagination Thinking (LIT), which is very close in spirit to the paper's contribution, even though implemented differently. Like the present paper, LIT argues that reasoning should be separated from modeling the observational space, trains recurrent latent states, and evaluates both linguistic and visual MNIST Sudoku. LIT reports 54.5% on visual Sudoku Extreme, whereas the abstract of the present paper claims that the prior best on Extreme is 4.1%. This claim must be revised. Also LIT should be discussed including the technical differences and their effect in experiments. K Farid, J Bratulić, S Mittal, C Schmid, T Brox, Latent Imagination Thinking: Beyond Recursive Models for Reasoning, ICLR 2026 2nd Workshop on World Models.
Also the statement that PaTh would fill the gap that continuous diffusion has no way to mark part of a sample as pending is not taking into account that other works like LIT, Thinking Pixel, recurrent diffusion, FRMs and looped flows all introduce internal state or recurrence precisely to avoid treating the observable generation state as the whole computation. Clearly, this limits the scope of the contribution of the present paper, although not in a critical manner. However, the paper's statements must be more honest in terms of these related works. I would also change the abstract to reflect the real strengths of the paper (see strengths above) rather than a generic statement, which could be regarded as overclaiming, since other recent works argued the same way already.
Another major weakness seems to be on the technical side of the concept. While simplicity is an advantage, there could be also a drawback here: because there is no way for the Thinker to use the internal representation of the diffusion model, the Thinker has to learn its own perceptual representation from scratch through an indirect control signal. The Thinker's small convolutional encoder has to rediscover whatever visual semantics it needs. I expect this to work only for visually simplistic settings used for the experiments in this paper, but I cannot imagine this is scalable to more complex visual settings.
Related to this is another overclaiming statement. While it is mentioned in the limitations that the method has a severe spatial-grounding dependency, the main text still says that Thinker token resolution need not coincide with Sudoku cells, which sounds like it has escaped symbolic/spatial alignment. But the appendix shows that it has only escaped exact 9×9 discretization. It still relies heavily on a fixed image-coordinate correspondence. The Thinker's tokens must remain spatially aligned with the conditioning; randomly translating/scaling the output while leaving the conditioning untransformed makes Sudoku cell accuracy collapse to chance. CLEVR makes this problem particularly visible. Relations/object tokens alone achieve only 50% spatial accuracy and 8% attribute binding. Giving the model part of the finished image does not help much. Even learned visual attribute embeddings do not solve spatial reasoning. Performance jumps only when the conditioning supplies a centroid mask that explicitly localizes the objects. This contradicts the headline notion of learning visual reasoning “without symbolic representation.” It only reasons well once the symbolic constraints have been anchored into image coordinates.
Questions for authors
Can you comment on the issue of the encoder being decoupled from the diffusion model and what this means for more complex visual settings that require a more sophisticated encoder?
How does this affect the claim of "visual reasoning without symbolic representation"?
Is the Thinker informed of diffusion timestep t?
How much of the performance comes from reasoning over the current visual state x_t, as opposed to solving the conditioning independently of x_t?
4 comments
Thank you for the rebuttal, which answers my questions and resolves some of my concerns. The exchange of UNet in favor of a transformer architecture brings some interesting new evidence, which, however, should not be over-interpreted, since multiple things were changed at a time and the cause of the better numbers has not been identified uniquely. One question that came up with the modified architecture. You write that the Painter's first two blocks serve as the Thinker's encoder, so the Thinker reads their hidden states instead of , and steers blocks 3 to 8. Are blocks 1–2 still frozen Painter blocks, whether their output is branched into both Painter and Thinker, and does the Thinker then influences blocks 3–8 while the entire MM-DiT remains frozen?
Thank you for your reply. We are glad that our rebuttal answered your questions and that you find the new results interesting.
UNet vs. MM-DiT Painter. We believe the MM-DiT result addresses the main concern of your review: that PaTh relies on "a fixed image-coordinate correspondence" and only reasons well once the constraints are "anchored into image coordinates". Without spatially aligned conditioning, PaTh with the MM-DiT Painter reaches 87.1% spatial accuracy on CLEVR (69.5% for the MM-DiT Painter alone), compared to 51.2% for the UNet Painter version. The dependence on spatial grounding therefore comes from the UNet Painter, not from PaTh, and the claim that PaTh learns visual reasoning without symbolic representations stands.
We agree that the rebuttal does not fully explain why the UNet-based PaTh fails without spatially aligned conditioning. Attributing it to the UNet's strong spatial inductive bias remains a hypothesis, although we believe the results provide strong evidence for it. Either way, our claim above does not depend on it.
Painter features as the Thinker's input (App. V). Yes, to all three questions. The entire MM-DiT Painter, including blocks 1–2, is trained in the first stage and stays frozen afterwards. At every Thinker call, blocks 1–2 run once on x_t, and their output is shared: the Painter continues from it through blocks 3–8, and the Thinker reads it in place of x_t. The Thinker's output then steers blocks 3–8 through residuals added after each block. No part of the Painter is trained or changed during the Thinker's training stage.
We would be happy to answer any further questions. If our response has addressed your concerns, we would be grateful if you would consider updating your score.
Sounds good. I raised my score to 3.
We thank the reviewer for the careful and constructive review. We address each point below.
W1 / W2. LIT, related work, and scope.
We thank the reviewer for highlighting LIT and apologize for overlooking this closely related work. LIT provides valuable evidence that separating latent reasoning from observation modeling benefits visual reasoning, and we agree that this motivation is shared with PaTh. We have added LIT to Table 1, corrected the prior-best accuracy, and revised the related work and abstract to acknowledge this shared foundation.
The main distinction is how this separation is achieved. LIT trains recurrent representations through a teacher–student imagination objective, with the teacher receiving additional views of the training solution. PaTh instead places a separate, compact reasoner alongside a frozen diffusion model and trains it through the standard reconstruction objective, without auxiliary latent targets. As the reviewer notes, this simple, modular coupling is a strength of our approach. PaTh reaches 71.2% on visual Sudoku Extreme versus LIT’s reported 54.5%, with approximately 10M versus 81M parameters, and demonstrates benefits across four visual constraint settings.
We have therefore removed the broad “gap we fill” claim and sharpened the contribution around this architecture and its empirical benefits, while expanding the discussion of LIT and the other recurrent approaches identified by the reviewer (Sec. 2; App. U).
W3 / Q1. The encoder is decoupled from the diffusion model; will it scale?
We treat decoupling and training the encoder from scratch as a hyperparameter that we hold fixed for the visually simple settings we study. Nothing prevents the Thinker from reading features of a pretrained model. We test this on Sudoku Extreme with an 8-block MM-DiT Painter (App. V): its first two blocks serve as the Thinker's encoder, so the Thinker reads their hidden states instead of x_t, and steers blocks 3 to 8.
Reading the Painter's features outperforms learning a separate encoder, so the Thinker can build on the Painter's representation.
We agree that this, like CLEVR, is a proof of concept of scalability rather than a demonstration on complex imagery, and we now list scaling to complex visual settings as an explicit future direction (Sec. 5, App. L.2).
W4 / Q2. Spatial alignment and "without symbolic representation".
We thank the reviewer for prompting us to investigate the source of this limitation. New experiments established that the spatial-alignment limitation is actually much weaker than the paper stated, and it comes from the UNet Painter rather than from PaTh. We hypothesise that it comes from the UNet's strong spatial inductive bias: its computation is mostly convolutional, so a residual that the Thinker adds at one position mainly affects the corresponding image region, and so the Thinker must know where each constraint belongs. A Painter based on SOTA transformer with ROtary Position Embeddings, whose every block mixes all positions through attention, should be largely free of this limitation. We test this on CLEVR with an MM-DiT Painter, keeping the Thinker's architecture, with no centroid mask for either network (App. L):
Without a mask, PaTh adds nothing to the UNet Painter, but with the MM-DiT Painter it raises spatial accuracy from 69% to 87% without any spatial anchoring, close to the 89.4% that the UNet PaTh reaches only with centroid masks. We updated the Limitations accordingly: the alignment requirement applies to Painters with strong spatial inductive biases, such as UNets, not to PaTh itself.
Q3. Is the Thinker informed of the timestep?
The recursion itself is not. The translator, which maps the Thinker's output to the Painter's residuals, receives a timestep embedding, as does the encoder.
Q4. How much comes from reasoning over x_t?
We ablate this on Sudoku Extreme and Hard (App. T.3):
On HARD, where most puzzles have many valid solutions, x_t is essential: without it, the Thinker cannot tell which solution the Painter is drawing, and solves no puzzle. On EXTREME, whose solution is unique, it still adds 13.5 points, acting as an additional state (about as much as the second latent state).