PaperScope
LIVE · 2026-09-15 05:40 UTC

Unlocking the Unsolvable: Teacher-Guided Curriculum for Data-Efficient RLVR

Yukang Zhu, Zhen Han

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2609.13997 v1
Category
Submitted
2026-09-12

Abstract

Reinforcement Learning with Verifiable Rewards (RLVR) has shown remarkable success in improving the mathematical reasoning of large language models. Yet problems beyond the model's current capability, where rollouts uniformly fail and no learning signal is produced, are structurally wasted despite marking the most informative training frontier. We show that these otherwise-inert problems can be unlocked via teacher-guided curriculum learning: partial reasoning traces from a stronger model create a graded difficulty landscape, and a backward-chaining curriculum progressively withdraws guidance until the model solves problems unaided. Training on only 128 unsolvable problems matches or exceeds GRPO trained on a full 2,000-problem corpus (~16x data efficiency) on the nine-benchmark average for both base models, while substantially expanding the reasoning boundary measured by pass@k at large k. Furthermore, we identify a distribution-shift cost that is particularly acute in the unsolvable-only regime and propose Monotone Frontier Curriculum (MFC), a method that monotonically drives training toward unguided solving, consistently outperforming existing curriculum methods.

Comment: 20 pages, 9 figures. Accepted to Findings of the Association for Computational Linguistics: EMNLP 2026

arXiv abs page · PDF · same-day batch