Sign inGet started
Paper · arXiv

Single-Rollout Hidden-State Dynamics for Training-Free RLVR Data Selection

Reinforcement learning with verifiable rewards (RLVR) can yield large reasoning gains from very few training instances, yet its strong sensitivity to which instances are used makes data selection a central bottleneck. Most existing selection pipelines rely on training-time optimization signals and/or require access to verifiable rewards or ground-truth answers over large candidate pools, which is costly and often infeasible in specialized domains. We study RLVR data selection in a setting where selection must be performed before any RL training and without labels or reward evaluation on the full pool. We propose SHIFT, a one-shot, training-free selector based solely on inference-time hidd...

AuthorsJianghao Wu, Jianfei Cai, Weiqiang Wang et al.
Primary categorycs.LG
Published27 May 2026
Last updated at source27 May 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/94456db6-dc8e-4f32-b144-2373dae544c4" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.