- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies adaptive repetition of existing Transformer blocks for mathematical reasoning. After a route-aware LoRA adaptation stage, a frozen language-model backbone is paired with a controller that observes updated hidden states and chooses whether to repeat the current block or advance. The controller is trained using on-policy sampled computation routes, a leave-one-out route advantage, and a mixed terminal reward combining answer correctness with the likelihood of a reference solution. Experiments use three 7–8B models, two training/evaluation tasks (GSM8K and MathQA), and two frozen-transfer tasks (SVAMP and MATH-500). The paper compares adaptive routing with fixed routes, exact-depth learned routes, shuffled route assignments, initial-feature routing, and search-supervised alternatives. It reports five-seed results and measures inference latency, KV-cache memory, and controller training costs.
Critical strengths
S1. Controlled evidence for question-specific computation routes. The paper compares the method against exact-depth learned routing, searched fixed schedules, modal routes, and shuffled question-to-route assignments. In particular, shuffled routes reduce accuracy despite preserving route multiset and execution depth, supporting a genuine benefit from question-dependent assignment rather than merely extra block executions.
S2. Reproducible breadth and meaningful cost accounting. The study includes three backbone families, five independent runs, in-domain and frozen-transfer evaluations, component ablations, and measured inference costs. The Qwen2.5-7B/GSM8K free controller reaches 94.9% at mean 2.16L, versus 93.5% for compulsory 3L, and the appendix reports concrete latency and KV-storage reductions relative to 3L routing.
Critical weaknesses
Practical efficiency and generalization remain unresolved. The approach needs a route-aware LoRA adaptation stage, controller imitation initialization, and up to 25,600 route evaluations per actor before deployment. At inference, repeated blocks create additional per-occurrence KV state and latency. For Qwen2.5-7B/GSM8K, free routing improves accuracy from 92.1% to 94.9% but increases measured per-question time from 6.2 s to 13.1 s compared with native execution. Thus, although free routing is more efficient than compulsory 3L, the practical advantage over a non-looped model trained or decoded under comparable total compute is not established. Furthermore, the two transfer datasets remain within mathematical reasoning, and the controller fixes its route before answer generation rather than adapting to intermediate reasoning states.
Questions for authors
Q1. How robust is adaptive routing outside mathematical reasoning, and can the controller adapt its route during decoding rather than committing to a single prompt-derived route?
Q2. The mixed reward requires a reference-solution likelihood scoring pass. Is the 0.8-point Qwen2.5-7B/GSM8K gain over correctness only RL worth the additional 16 GPU-hours per seed reported for reference scoring, and does this trade-off hold across the other models and datasets?