Training-Free Prompt Selection for Efficient Reinforcement Learning With Partial Rollouts↗ (원문, 새 창)

본문 미리보기

arXiv:2610.24229v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards (RLVR) has emerged as a prominent paradigm for training reasoning models, but its computational cost makes efficient data selection increasingly important. Since training examples contribute unequally to learning, selecting a small, informative subset can offer a more efficient alternative to using the entire data pool. The training-free selection method estimates prompt value with hidden states from