- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper investigates whether neural cellular automata with strictly local neighborhood communication and recurrent stochastic updates can solve spatial reasoning tasks. It evaluates sudoku, maze solving, ARC-AGI-1 and studies how performance changes with longer rollouts, larger grids, and multiple stochastic solution attempts. The results provide evidence that local update rules can support reasoning beyond immediate spatial neighborhoods. In particular, a model trained on 9-by-9 mazes achieves 100% accuracy on the reported 201-by-201 Maze-OOD test set.
Critical strengths
The paper demonstrates successful local recurrent computation across several tasks, including maze solving and Sudoku. Generalization from 9-by-9 to 201-by-201 mazes is really impressive! The experiments explore spatial generalization, rollout depth, and parallel stochastic trials.
Critical weaknesses
- The main limitation is that training-run variability is not clearly reported for Table 1. For example, it is unclear whether the Maze-Hard accuracies come from one trained checkpoint per configuration or are averages across independently trained models. The table does not report a corresponding standard deviation or the number of training runs, and I sadly could not find an explicit checkpoint-selection rule for these results. I consider this a reporting and reproducibility concern that can be clarified, rather than a reason on its own to reject the paper.
The related-work discussion does not include "2D Spatial Reasoning with Adaptive Neural Cellular Automata" (accepted @ NeurIPS 2026), which also studies Sudoku and maze solving. Discussing its use of learned adaptive neighborhoods in relation to the strictly local communication studied here would help contextualize the contribution. As this is recent work, my suggestion is intended to improve the discussion.
Questions for authors
Q1. Are the results in Table 1 based on a single checkpoint or averaged across independent training runs? Please clarify checkpoint selection and report variability across training seeds separately from test seeds.
Q2. Why use all-step supervision for Maze and Sudoku-OOD but last-step supervision for Sudoku-Extreme? Have you compared both schemes on the same benchmark?
Q3. Have you explored larger neighborhood variants? It would be interesting to know whether widening the locality improves accuracy or reduces the required number of rollout steps.
5 comments
Specific Response 1 to Reviewer urSm
Item 1. Training-run variability and checkpoints
Weakness #1: The main limitation is that training-run variability is not clearly reported for Table 1. For example, it is unclear whether the Maze-Hard accuracies come from one trained checkpoint per configuration or are averages across independently trained models. The table does not report a corresponding standard deviation or the number of training runs, and I sadly could not find an explicit checkpoint-selection rule for these results. I consider this a reporting and reproducibility concern that can be clarified, rather than a reason on its own to reject the paper.
Question #1: Are the results in Table 1 based on a single checkpoint or averaged across independent training runs? Please clarify checkpoint selection and report variability across training seeds separately from test seeds.
This is an important point, and we fully agree that being clear on the checkpoint selection and reported variability are critical for reproducibility.
First, we do not use early stopping or best-checkpoint selection. Every run uses the final checkpoint at the end of training, with Exponential Moving Average (EMA) weights. We now state this explicitly in Appendix C (Experimental Settings).
Second, In the original submission, Table 1 reported the best of 3 independently trained runs, which is also the checkpoint released with our codebase. This was done to limit the cost of the full test-time scaling evaluation, and is in line with baselines such as TRM and LoopViT, which report single-checkpoint results.
We agree, however, that variance across independent training runs gives a more complete and transparent picture. We have now run the full test-time scaling evaluation for all three training seeds, and Table 1 reports the mean ± std across training runs, alongside the best-seed result for comparison with single-checkpoint baselines. The only exception is Visual Sudoku, which we report for a single training run because of its high training cost (see Appendix C.4), and because this experiment is intended as a proof of concept that NCAs can scale to large pixel-space reasoning tasks, rather than as a benchmark comparison.
Specific Response 2 to Reviewer urSm
Item 2. Relevant related work
Weakness #2: The related-work discussion does not include "2D Spatial Reasoning with Adaptive Neural Cellular Automata" (accepted @ NeurIPS 2026), which also studies Sudoku and maze solving. Discussing its use of learned adaptive neighborhoods in relation to the strictly local communication studied here would help contextualize the contribution. As this is recent work, my suggestion is intended to improve the discussion.
We thank the reviewer for pointing us to this highly relevant work by Spitznagel and Keuper, which we were unaware of at the time of submission (since it was made public on arXiv after the ICLR submission deadline). We have added it to the Related Work section and mention the use of adaptive neighborhoods as a potential direction for future work in the revised manuscript. Here, we will also now comment on the differences and complementarity of our contribution and theirs.
With respect to the differences between NCA and adaptive NCA (aNCA), aNCA's connectivity is more dense, (each cell perceives up to cells, across the three heads), and the cell's connections are data-dependent and can be rewired at every step to any other cell in the grid, with no spatial constraint. In contrast, we impose strict, fixed, locality from the ground up in order to ask how far local-only computation can take us. One of the motivations is that answers under these exact constraints could help inform the design and research of fully decentralized, low-power computing substrates.
With respect to the complementarity of the contributions, Spitznagel and Keuper show that more effective connectivity patterns can be learned directly from data, adapting to each task and even to each cell, without knowing in advance which connections will be useful. We agree that different tasks should benefit from different inductive biases and neighborhood topologies. Intuitively, a task like Sudoku should benefit greatly from full visibility over rows, columns and blocks, which a 3×3 neighborhood does not directly provide. Automatically discovering such inductive biases could thus lead to more efficient training and potentially better generalization. Overall, we see a middle ground between our work and theirs as a promising direction for future research: architectures that remain mostly local to preserve low-power, decentralized communication, but add a few (possibly adaptive) long-range connections that provide the right inductive biases for the task at hand. We now mention this possibility in the Discussion section.
General Response to Reviewer urSm
We thank the reviewer for their positive assessment and highly constructive feedback. We attempt to address each point below. The reviewer's feedback has enabled us to improve the manuscript with additional results and discussion. We believe these changes improve both the reproducibility of our results and the positioning of the paper with respect to related work.