- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies curriculum design for mathematical reasoning with RLVR. Using an idealized transport model in one-dimensional Wasserstein space, the authors show that smaller steps with repeated recalibration can reduce deviation from an ideal learning path. Motivated by this analysis, they propose Ri1A, which ranks problems by initial success rates and progressively selects them using an adaptive difficulty threshold. Experiments across multiple models and benchmarks report efficiency gains and performance improvements in some settings.
Critical strengths
- Ri1A uses a single initial difficulty scan and stage-wise local evaluations to update the curriculum. This limits the additional cost of curriculum selection and makes the method practical to integrate into RLVR training.
- The paper provides a fairly comprehensive experimental evaluation, covering both reasoning performance and training efficiency across multiple models and benchmarks, along with detailed ablation studies.
Critical weaknesses
- The connection between the theory and the practical algorithm remains insufficiently established. Ri1A uses the fraction of problems selected per stage as a proxy for geometric step length and interprets threshold updates based on the model’s current performance as geometric recalibration. However, it does not establish how these choices control the actual Wasserstein displacement or directional error. Although the paper discusses these limitations and provides related ablations, it does not directly validate the proposed geometric mechanism.
- The algorithmic novelty appears limited. Ri1A combines initial difficulty ranking, gradually introducing harder problems, adjusting difficulty using model performance, and deferring difficult problems. However, similar ideas of initial difficulty ranking and gradually introducing harder problems have been explored in AdaCuRL [1], while AdaRFT [2] considers adjusting difficulty using model performance. An extension proposed in the same AdaCuRL paper also revisits problems initially excluded as too difficult. Ri1A therefore appears to offer an incremental combination of existing ideas.
[1] AdaCuRL: Adaptive Curriculum Reinforcement Learning with Invalid Sample Mitigation and Historical Revisiting. arXiv, 2025.
[2] Efficient Reinforcement Finetuning via Adaptive Curriculum Learning. arXiv, 2025.
Questions for authors
- Could you address the concerns raised in the Weaknesses section?
- The threshold in Eq. (7) uses the current model’s average difficulty on the previous stage’s problems, but candidate problems are evaluated using difficulty scores from the initial model. For fixed problem sets, better current performance lowers the threshold while candidate scores remain unchanged. This can defer more problems even if the model has become better at solving them. Is this behavior intended?
As the discussion period draws to a close, we would appreciate any further feedback on our responses and additional experiments. In particular, please let us know which concerns remain unresolved so that we can address them directly.