跳到正文
Jones Ray

ScholarPulse 日报 2026-07-06

2026-07-06 学术简报:2 篇。PACE框架通过小规模代理基准可靠预测大型代理评估性能,实验表明其成本仅为全评估的1%以下,预测精度高(MAE<4%,Spearman相关>0.80),显著降低开发与评估开销。

今日速览

序号标题来源日期主题推荐等级
1PACE: A Proxy for Agentic Capability EvaluationarXiv2026-07-02AI-Agent高
2A-TMA: Decoupling State-Aware Memory Failures in Long-Term Agent MemoryarXiv2026-07-02AI-Agent高

重点论文与技术动态

1. PACE: A Proxy for Agentic Capability Evaluation

一句话结论

PACE框架通过小规模代理基准可靠预测大型代理评估性能,实验表明其成本仅为全评估的1%以下,预测精度高(MAE<4%,Spearman相关>0.80),显著降低开发与评估开销。

核心内容

方法与数据

价值判断

摘要 Evaluating LLM agents on benchmarks like SWE-Bench and GAIA can be expensive, time-consuming, and requires complex infrastructure. A single evaluation can cost thousands of dollars and take days to complete. In contrast, non-agentic LLM benchmarks that test individual capabilities (e.g., reasoning, code generation) are fast and cheap to run. In this paper, we investigate whether performance on expensive agentic benchmarks can be accurately predicted by the performance on a small, carefully selected subset of atomic evaluation instances. We introduce PACE, a framework that constructs proxy benchmarks by selecting instances from existing non-agentic evaluations whose aggregate scores most reliably predict model performances on agentic benchmarks. Given a pool of candidate instances spanning atomic capabilities, PACE fits a regression that maps a model's scores on a compact subset of source instances to its score on the target agentic benchmark. The subset itself is curated by combining two complementary instance-selection strategies, target-relevance local selection and globally informative global selection. We apply PACE to the 4 target agentic benchmarks in this paper, which yields PACE-Bench, the concrete proxy benchmark that we evaluate in the paper. Experiments across 14 models, 4 agentic benchmarks, and 19 non-agentic benchmarks show that PACE-Bench predicts agentic scores with leave-one-out cross-validation (LOOCV) mean absolute error (MAE) under 4%, Spearman correlation above 0.80, and pairwise model-ranking accuracy around 85%, all at much less than 1% of the full agentic evaluation cost. We further analyze the selected proxy instances, revealing which skills each agentic benchmark uniquely demands. PACE enables practitioners to obtain reliable estimates of agentic performance during model development, selection, and routing, without the overhead of full agent evaluation.

2. A-TMA: Decoupling State-Aware Memory Failures in Long-Term Agent Memory

一句话结论

ATMA通过显式状态角色管理,有效缓解长期代理记忆中的幽灵记忆问题,提升系统准确性。

核心内容

方法与数据

价值判断

摘要 Long term memory lets LLM agents act as persistent assistants, but user facts change. A useful memory system must know what is true now, what used to be true, and what changed. We study \emph{ghost memory}, a state coordination failure in which old, current, and transition facts coexist in the memory bank, remain mixed during retrieval, and mislead the answer model. We argue that memory systems should be understood and optimized from three levels: bank maintenance, retrieval, and answer time resolution. We propose ATMA, a state aware overlay for existing memory systems. ATMA keeps superseded and transition records in the bank, builds evidence packets for the query's requested state view, and exposes current, historical, and transition labels to QA. We further call for decoupled evaluation of bank, retrieval, and answer level failures, since final QA accuracy can hide where ghost memory occurs. To make this failure measurable, we build LTP (LoCoMo Temporal Plus), a conflict heavy benchmark for ghost memory, and evaluate on LoCoMo for long conversation generalization. On LTP, Graphiti+ATMA improves conflict accuracy by 0.240 absolute over Graphiti. On LoCoMo, Graphiti+ATMA raises temporal F1 from 0.0295 to 0.1705. The gains are host dependent, but they indicate that explicit state roles can reduce memory failures hidden by final QA accuracy.