ai.hackcv
论文精选 65arXiv

Unlearnable, or Unmeasured? On the Reliability of Difficulty Labels in RLVR· RLVR 中的不可学习现象再评估

Reinforcement learning with verifiable rewards (RLVR) has become an important approach for improving reasoning during post-training. Recent work suggests that some difficult prompts remain resistant to learning even when they occasionally produce correct solutions. We revisit this unlearnability phenomenon and find that the affected prompts do improve, at roughly one third of the learnable rate, while the difficulty-defined set used to study them is much less reproducible than expected. These difficulty labels are estimated from a limited number of sampled responses. Combining them across seeds can further change which prompts are selected instead of simply reducing measurement noise. We develop a sampling-based framework for quantifying this instability and determining how much evaluation

AI 解读论文

重新评估 RLVR 中的不可学习现象,发现学习率低而非不可学习。

核心方法
通过采样框架量化任务选择的不稳定性,分析不同随机种子下任务的改进情况。
适合谁读
研究者
要解决的问题
论文探讨了在强化学习中,某些被标记为困难的任务是否真的无法学习,还是由于评估方法不准确造成的。
关键实验
通过不同随机种子的多次采样实验,评估任务选择的稳定性和改进速度。
主要贡献
揭示了所谓‘不可学习’任务实际上是学习率较低,且难度标签的集合不如预期的可重复。
意义与局限
该研究对于理解RLVR中任务难度的评估和学习过程具有重要意义,但限于采样数量可能影响标签的准确性。
领域:cs.AI作者:Chandak Chakma、Syed Nazmus Sakib、Nafiul Haque
相关推荐
论文精选 65已解读

Simulated Control Evals· 模拟控制评估

Control evaluations measure whether safeguards can prevent an AI model from causing undesi…

领域:cs.AI作者:Jeffrey Olmo、David Zhang、Tyler Tracy
📎 arXiv🕒 10-23 01:26🔗 arxiv.org

本站内容由 LLM 精选聚合,原文版权归 arXiv 所有 · 摘录仅供参考