跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

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

全站更新概况

+806新增论文
+644其中 AI 相关
+92已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.24413

MINT: Meeting-time Indicators for Truncation in Multi-Step Off-Policy RL

Seungyub Han, Taehyun Cho, Dohyeong Kim, Kyungjae Lee, Jungwoo Lee

原文摘要

Many multi-step off-policy temporal-difference methods handle policy mismatch through products of per-step trace coefficients, leading to a trade-off between variance control and long-horizon signal. The maximum trace length consequently becomes a sensitive hyperparameter. We propose MINT (Meeting-time INdicators for Truncation), which replaces these products with a binary stopping indicator: one until coupled behavior and target trajectories first meet, zero thereafter. At the true value function, the indicator's idempotence yields a variance bound governed by meeting-time survival. For practical implementation, a single sampled action provides a model-free surrogate for the stopping rule, requiring no transition model or mixing-time estimate. We derive separate sufficient conditions for contraction of the state-coupled operator and its practical surrogate under fixed-policy evaluation. On MuJoCo and DeepMind Control tasks, MINT outperforms the reported multi-step baselines; the main MuJoCo comparison uses a common cap without per-task cap-length tuning. We also demonstrate the effectiveness of MINT on Atari 100k, RWRL, and OGBench experiments; MINT adapts the backup horizon to reduce target variability relative to long fixed-horizon backups across tasks and dynamics.

cs.LG · cs.AI

新论文 · v1arXiv:2610.38351

Proprioceptive Finger Force Estimation for Reliable Box Manipulation

Junha Cha, Chanwoo Kim, Kisang Park, Yeoncheol Jang, Doyoung Kim, Seungmin Kim, Kyungjae Lee, Sungjoon Choi

原文摘要

Reliable box manipulation requires successful placement without damage, which depends on maintaining sufficient contact force without excessive loading. We hypothesize that per-finger force feedback improves manipulation reliability relative to open-loop finger commands. To this end, we present Finger External-Force Estimation from Proprioceptive SignaLs (FEEL), an uncertainty-aware residual method that estimates per-finger external force magnitude from proprioceptive histories. Our method combines a calibrated virtual-spring estimate with a residual distribution predicted by a Mixture Density Network (MDN) and requires no dedicated contact sensors during deployment. The estimated force is used for continuous per-finger adaptation, while predictive uncertainty is evaluated as an empirical signal of ambiguity in proprioceptive force estimation. Across ten fingers and contact forces spanning 0-20 N, our method achieves a mean RMSE of 0.251 N, reducing the error by 92.8% relative to the virtual spring and by 9.4% relative to an end-to-end MDN. In box pick-and-place, force adaptation maintains task success at 10/10 and increases both damage-free outcomes and reliability from 7/10 to 10/10. The project page is available at https://finger-force-estimation.pages.dev/

cs.RO