- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper asks where RLVR loses solution diversity, using Countdown so it can tell failing to start a solution apart from failing to finish one. Across PPO and GRPO, coverage drops by up to 67%, and almost all of the probability shift happens at the first step. When given an unselected first step, the trained model still completes the solution, so it can still solve the problem. Layer interpolation recovers 37% of coverage, and the same pattern appears on six math benchmarks at 7B/14B.
Critical strengths
1.The access–execution decomposition provides a useful perspective beyond conventional pass@k and diversity metrics. 2.The recovery experiments suggest practical opportunities to preserve reasoning diversity during training and inference.
Critical weaknesses
1.The entrance-clamping experiments do not fully establish that entrance selection is the primary cause of solution-space contraction, since providing a prefix also changes the model's context. 2.The layer-interpolation results are promising, but their robustness across interpolation configurations and training setups remains unclear. 3.The experiments primarily use Qwen2.5 models, it is unclear whether the observed solution-space contraction persists in models with substantially improved reasoning capabilities, limiting the generalizability and practical relevance of the findings.
Questions for authors
1.Why do the authors choose Qwen2.5 rather than newer reasoning models? Can the main findings be reproduced on a more recent model family? 2.How robust is layer interpolation across different configurations and inference budgets?