跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1164新增论文
+869其中 AI 相关
+88已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-06 04:56 · 全站最近入库:2026-11-05 12:13各信源进度 →

统计口径与数据新鲜度

统计 2026-11-05 05:19 — 2026-11-06 05:19(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-06 04:56最近发现新增版本:2026-11-05 12:13库内论文最新更新时间:2026-11-05 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

15,949 已收录论文13,765 AI 相关3,571 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-06 04:54(北京时间)
版本更新 · v2arXiv:2509.25808

Improving Sampling Efficiency in RLVR through Adaptive Rollout and Response Reuse

Yuheng Zhang, Wenlin Yao, Changlong Yu, Yao Liu, Qingyu Yin, Bing Yin, Hyokun Yun, Lihong Li

Group relative policy optimization (GRPO) trains large language models with verifiable rewards by normalizing rewards within response groups. When every response in a group receives the same reward, the advantages vanish and the group provides no policy gradient signal. We propose Adaptive Rollout and Response Reuse Policy Optimization (AR3PO) to obtain informative groups with fewer generations. Adaptive rollout samples responses to each prompt in stages and stops sampling once the model generates a correct response. If all sampled responses are incorrect, response reuse replaces one of them with a past correct response to the same prompt, when available, and recomputes the group advantages. Policy-recomputed reuse trains on the updated groups using probabilities recomputed under the rollout policy; advantage-only reuse uses historical responses only to compute advantages. Across four mathematical benchmarks with 7B and 8B models, AR3PO consistently improves over GRPO and achieves performance comparable to DAPO while requiring up to $4.2\times$ fewer generated responses. Experiments with a 32B model also show comparable performance to DAPO at a similar training stage with substantially fewer generated responses.

尚无 AI 解读,展示原文摘要

cs.LG
arXiv ↗PDF ↗
首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1540ACL Anthology · ACL 2026

Mitigating Lost in Multi-turn Conversation via Curriculum RL with Verifiable Accuracy and Abstention Rewards

Ming Li, Pei Chen Amazon, Zhenhao Zhang Amazon, Tao Yang Amazon, Xinyang Zhang Anthropic, Han Li Shopify, Tianyu Cao, Ming Zeng Amazon 等 13 位作者

Large Language Models demonstrate strong capabilities in single-turn instruction following but suffer from Lost-in-Conversation (LiC), a degradation in performance as information is revealed progressively in multi-turn settings. Motivated by the current progress on Reinforcement Learning with Verifiable Rewards (RLVR), we propose Curriculum Reinforcement Learning with Verifiable Accuracy and Abstention Rewards (RLAAR), a framework that encourages models not only to generate correct answers, but also to judge the solvability of questions in the multi-turn conversation setting. Our approach employs a competence-gated curriculum that incrementally increases dialogue difficulty (in terms of instruction shards), stabilizing training while promoting reliability. Using multi-turn, on-policy rollouts and a mixed-reward system, RLAAR teaches models to balance problem-solving with informed abstention, reducing premature answering behaviors that cause LiC. Evaluated on LiC benchmarks, RLAAR significantly mitigates LiC performance decay (62.6% to 75.1%) and improves calibrated abstention rates (33.5% to 73.4%). Together, these results provide a practical recipe for building multi-turn reliable and trustworthy LLMs.

尚无 AI 解读,展示原文摘要

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

ACL Anthology · ACL 2026 ↗PDF ↗