跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+97新增 AI 导读

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

统计口径与数据新鲜度

统计 2026-11-19 23:24 — 2026-11-20 23:24(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

UpliftMem: Learning Set-Level Uplift for Agent Memory Retrieval

Mengkun Liang, Haoran Qiang, Guannan Liu, Junjie Wu

原文摘要

Large language model (LLM) agents draw on external memory to guide new tasks, raising the question of which memories to retrieve together to improve execution. Learning set values requires outcome feedback, but evaluating each untested alternative costs an additional rollout. We introduce \textsc{UpliftMem}, which learns set-level execution uplift relative to the same executor without memory. Our analysis of how retrieval preferences limit feedback coverage motivates targeted probes. Under a correlated Gaussian surrogate, we derive a closed-form expected value of sample information (EVSI) criterion that prioritizes probes by their expected benefit to local retrieval decisions. The feedback trains a shared scorer with the executor frozen, and inference requires no probing. Across ALFWorld, WebShop, and BigCodeBench, \textsc{UpliftMem} achieves best or joint-best success rates among evaluated methods. On fixed-store MemSyco-Bench evaluations, decision accuracy increases from 41.7\% to 66.5\% with Qwen3-4B and from 44.4\% to 68.8\% with Qwen3-8B. At matched probe budgets, EVSI improves decision accuracy over random probing by 10.6 and 13.9 percentage points, respectively.

cs.AI