- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a method for coordinating local reasoning results to ensure global consistency when a complex task is decomposed into multiple subproblems. Unlike Sheaf-ADMM, which relies on mathematical optimization, the proposed NRR framework uses trained neural networks to iteratively update local solutions, followed by a reconciliation step to achieve global consistency. Experiments on tasks such as Sudoku and maze-solving demonstrate the effectiveness of NRR and its performance improvements over baseline methods.
Critical strengths
The proposed method is well conceived, framing local coordination as a learnable reasoning process that can be jointly optimized using a recurrent neural network. The ablation studies provide evidence for the contributions of the shared maps, and dual memory. Furthermore, large-scale experiments demonstrate that NRR achieves a more favorable performance–latency trade-off than the Global-RecurProx approach.
Critical weaknesses
The experimental evaluation has several limitations. First, the main text devotes fewer than two pages to experimental results, limiting the depth of the empirical analysis and making it difficult to assess NRR's specific advantages over Sheaf-ADMM quantitatively. Second, the large-scale experiments do not explicitly report the performance gap between NRR and Sheaf-ADMM, leaving the extent of NRR's improvements unclear. Finally, the method relies on predefined local views and overlap relationships. While such structures arise naturally in problems like Sudoku, it remains unclear how they should be identified or constructed for more complex, real-world tasks. This raises questions about the method's generalizability and its applicability to domains where the decomposition structure is not readily available.
Questions for authors
- The authors should report Sheaf-ADMM's performance in the large-scale experiments and quantify the improvements achieved by NRR.
- For more complex, real-world tasks, how are local views and their overlap relationships defined or constructed? Does this process require domain-specific prior knowledge or manual intervention?
- The authors should provide a controlled comparison between NRR and Sheaf-ADMM using the same local solver, so that the performance differences attributable to the coordination mechanisms can be isolated more clearly?
7 comments
Response to Reviewer eash (2/2)
Q1: Sheaf-ADMM in the large-scale experiments. We evaluated the Sheaf-ADMM width-30 checkpoint on the larger mazes, following the same zero-shot protocol used for NRR and TRM (same instances, same horizon, no finetuning).
| Method (trained at width 30) | Width 45 | Width 60 | Width 90 |
|---|---|---|---|
| Sheaf-ADMM | 39.2 ± 3.4 | 13.4 ± 2.6 | 2.3 ± 1.0 |
| TRM | 51.6 ± 3.2 | 19.7 ± 2.5 | 3.6 ± 1.2 |
| NRR | 75.9 ± 2.0 | 54.5 ± 2.9 | 27.8 ± 3.5 |
The gap to Sheaf-ADMM widens as the maze grows (25.6 → 36.7 → 41.1 points at widths 30, 45, 60, and narrows to 25.5 at width 90 where both methods degrade), which is the comparison the large-scale discussion should have included. These values are added to the size-transfer figure and table in App. E.6.
Q2: View construction. Addressed in W2, with the generic-patch evidence (91.4% on Sudoku) and the explicit statement that ARC's demonstration encoder falls outside the local-view assumption.
The authors have responded to your reviews. Please read their response and reply. Please specify which concerns are resolved and which remain. Please update your review and score if the assessment has changed.
AC
Response to Reviewer eash (1/n)
We thank you for the concise review and for the three requests, all of which target the same gap: the main text under-reports the experiments and never places NRR next to Sheaf-ADMM under a controlled contrast. The revision expands Sec. 6 and answers all three: the large-scale results now include Sheaf-ADMM (Q1), the same-local-solver comparison is added as a 2×2 design (W3/Q3), and view construction is discussed with quantitative evidence rather than only acknowledged as a limitation (W2).
W1: Depth of the empirical analysis in the main text. We agree the main text was thin. Sec. 6 now spans Sec. 6.1--6.4 and contains the controlled comparison table, the learned-communication table with ten-seed paired contrasts, the local-solver × coordination comparison, the matched-cost and native-size analysis at widths 30 and 90, and one paragraph per result that states what it does and does not establish. Measurements previously confined to the appendix (interaction versus final aggregation, difficulty stratification, and the accuracy--latency frontier) now appear in the main text, with the full curves and the latency/time-to-solve table in App. E.
W2: Defining views and overlaps for more complex tasks. The construction has three parts, and only the first is task-specific. First, the partition: output coordinates are grouped into overlapping local views. For grids this can always be done with patches, and the patch construction used on Maze and ARC (4×4 patches at stride 3, eight-neighbor edges between patches that share valid cells) is fully generic. Second, the edge variable: each edge records the absolute output coordinates its endpoints share, which is what makes a comparison meaningful and requires no task knowledge beyond the coordinate system. Third, the restriction maps: these may be semantic selectors, where the shared cells have a known local position in both views (Sudoku rows, columns, boxes), or learned maps, which is the default elsewhere. Overlap coverage (each output location in at most c views) and bounded graph degree are the assumptions the complexity analysis needs.
We can quantify how much the task-specific part buys. On Sudoku, replacing the constraint-group views with generic overlapping 3×3 patches reduces accuracy from 95.2% to 91.4%, and the remaining difference comes from views that expose the actual constraints rather than from hand-tuning of the maps. On ARC the encoder attends to demonstration memory, which we now describe as a learned input stage outside the locality assumption. The revision states the assumption, this evidence, and learned view discovery as future work.
W3 / Q3: Controlled comparison under the same local solver. This was the missing cell of the design and we added it. The 2×2 varies the local solver (exact proximal as in Sheaf-ADMM, or RecurProx) and the coordination mechanism (learned link or sheaf negotiation), in the benchmark setting with everything else fixed.
Negotiation adds 4.5/3.9 points under the proximal solver and 5.3/5.3 under RecurProx, so the benefit of the coordination mechanism is stable across local-solver families. Concretely, the difference between NRR and the Sheaf-ADMM rerun (95.2 vs 71.6 on Sudoku) is mostly the local solver, not the coordination, and this decomposition is now reported in Sec. 6.3 instead of being inferred from two separate rows.