- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces SPIRE, a framework for student-conditioned supervision allocation in implicit chain-of-thought reasoning. Rather than assigning teacher key–value (KV) states solely according to teacher-side importance scores, SPIRE uses the student's attention queries to evaluate the compatibility of candidate teacher states with individual latent reasoning steps. It then employs dynamic programming to select an ordered, non-reusing path of teacher states and uses the selected KV states as training targets. The selection mechanism introduces no additional trainable routing parameters and is removed at inference time. The paper evaluates SPIRE on three arithmetic reasoning benchmarks and three model backbones. The reported results show improvements over existing implicit reasoning baselines, and the ablation studies provide evidence for student-conditioned selection and non-reusing supervision paths.
Critical strengths
- A useful and clearly formulated problem. The paper distinguishes selecting informative teacher states from deciding which states are useful for particular student steps. This is a relevant question for latent reasoning, where many teacher states must supervise a much shorter student trajectory.
- A lightweight training-time mechanism with consistent reported results. SPIRE reuses existing representations, adds no trainable routing parameters, and does not change inference. The reported average accuracy exceeds the strongest implicit baseline on each of the three backbones.
Critical weaknesses
- The matching criterion and its contribution are not sufficiently validated. Section 3.2 measures supervision utility by the change in answer cross-entropy after injecting teacher KV into a student step. SPIRE instead maximizes query–key cosine similarity, but does not directly show that higher similarity predicts greater utility. Attribution is also confounded: Teacher-only uses 12 teacher-selected states, while SPIRE selects 12 from a pool of 18, changing both the candidate pool and the allocation rule.
- Performance is highly sensitive to candidate-pool size. Increasing the pool from to drops average accuracy from 33.4% to 7.1%. The paper does not explain this sharp decline, leaving the method’s robustness and the behavior of its selection mechanism unclear.
- The evaluation scope is narrow. All three benchmarks concern arithmetic reasoning, and GSM8K and GSM-Hard are closely related. The results support the reported settings but do not establish generalization to other reasoning domains or task types; the claims should be scoped accordingly.
Questions for authors
- Can the authors show whether the query–key matching score used by SPIRE is associated with the intervention-based utility from Section 3.2? In particular, does selecting higher-scoring candidates tend to reduce answer loss more than selecting other candidates for the same student step?
- Figure 6 reports 7.1% average accuracy at candidate-pool size , while gives 33.4%. Can the authors clarify what causes this drop and whether it reflects training behavior, candidate selection, or a reporting issue?