跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+1087新增论文
+800其中 AI 相关
+64已有论文修订
+100新增 AI 导读

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-06 10:06最近发现新增版本:2026-11-06 10:05库内论文最新更新时间:2026-11-05 12:54

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

16,167 已收录论文13,917 AI 相关3,571 有修订112 HF 社区发现

浏览论文库

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

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

面向稀疏奖励任务与多样奖励塑形的零样本协调

Zero Shot Coordination for Sparse Reward Tasks with Diverse Reward Shapings

Keenan Powell, Peihong Yu, Pratap Tokekar

AI 速览:作者提出用随机奖励塑形训练方法集成,以提升智能体与采用不同奖励塑形但稀疏目标相同的未知伙伴在稀疏奖励任务中的零样本协调表现。

Many Multi-Agent Reinforcement Learning (MARL) agents fail to adapt properly to cooperating with agents trained with the same objectives but different seeds, algorithms, or other training differences. This is the problem of Zero-Shot Coordination (ZSC), which focuses on training agents to cooperate well with unknown agents. ZSC has been studied for a variety of tabular cases and simple games such as Hanabi, achieving excellent results. However, existing solutions to ZSC only consider identical rewards for your trained agents and all future partners. This is not realistic for the trained agents, as they do not consider the problem of cooperating with agents that have identical sparse objectives but shape the rewards for those objectives in different manner. To address this issue, we show how to train an ensemble of methods using randomized reward shapings chosen using 4 selection algorithms. Experiments done on the Overcooked environment demonstrate consistent improvements of 62.2%-119.2% in sparse reward over baseline ZSC algorithms when playing with agents that have identical sparse rewards but different reward shapings.

cs.LG
arXiv ↗PDF ↗
新论文 · v1arXiv:2610.37547

When, Where, and What to Correct: Human-Guided Adaptive Residual Correction for Robot Policies

Anukriti Singh, Maxime Caniot, Pratap Tokekar, Firas Abi-Farraj

Imitation policies that reliably execute most of a manipulation trajectory can still fail in localized regions requiring last-mile precision. Updating the full policy or exploring residual actions everywhere treats this local failure as a global learning problem. We introduce Adaptive Residual Correction (ARC), a lightweight post-training module that uses reinforcement learning (RL) to learn a residual correction on top of a frozen policy while using sparse human corrections to structure autonomous exploration. Rather than treating human corrections as imitation targets, ARC uses pre-intervention states to determine 'when' residual control should become active and correction geometry to determine 'where' in residual action space autonomous refinement should explore; task reward determines 'what' residual is ultimately executed. Across three precision-manipulation tasks on a real robot, ARC improves average task success from 33.3% to 75.0%. The human corrections define task-dependent 2-3 dimensional subspaces of the seven-joint residual space that retain 96.0-97.7% of squared correction magnitude. Together, these results show that sparse human corrections can localize and constrain autonomous post-training without requiring the observed correction itself to serve as the final action target.

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

cs.RO · cs.AI
arXiv ↗PDF ↗