跳到正文
Jones Ray

ScholarPulse 日报 2026-06-24

2026-06-24 学术简报:2 篇。SHERLOC通过结构化诊断定位框架显著提升代码修复代理的效率和准确性。

今日速览

序号标题来源日期主题推荐等级
1SHERLOC: Structured Diagnostic Localization for Code Repair AgentsarXiv2026-06-23RAG高
2Are We Ready For An Agent-Native Memory System?arXiv2026-06-23RAG高

重点论文与技术动态

1. SHERLOC: Structured Diagnostic Localization for Code Repair Agents

一句话结论

SHERLOC通过结构化诊断定位框架显著提升代码修复代理的效率和准确性。

一段话:SHERLOC针对LLM代理在代码修复中定位故障耗时过长的问题,提出训练-free框架,提供可操作诊断上下文而非仅文件检索。其结合推理LLM与紧凑仓库工具,无需微调即可实现SOTA性能:在SWE-Bench Lite上84.33%准确率@1,在SWE-Bench Verified上81.27%召回率@1;注入诊断后,修复率平均提升5.95个百分点,定位和总token消耗分别降低36.7%和23.1%。

核心内容

方法与数据

价值判断

摘要 LLM agents solve repository-level coding tasks through multi-turn tool use, but utilize half their budget on locating faults before editing. Dedicated localization frameworks have emerged, yet are still evaluated as file retrieval rather than actionable diagnosis, producing locations without the diagnostic context a repair agent needs. We introduce SHERLOC (Structured Hypothesis-driven Exploration and Reasoning for Localization), a training-free framework pairing a reasoning LLM with compact repository tools and self-recovery, without fine-tuning or multi-agent orchestration. SHERLOC reaches state-of-the-art localization across model scales: 84.33% accuracy@1 on SWE-Bench Lite and 81.27% recall@1 on SWE-Bench Verified; at ~30B parameters, it matches or outperforms other agentic methods. Injecting our locations and diagnostic findings into repair agents yields, on average, +5.95 pp resolve rate on SWE-Bench Verified while cutting localization and total tokens by 36.7% and 23.1%.

2. Are We Ready For An Agent-Native Memory System?

一句话结论

代理内存系统无单一最优架构,效果高度依赖内存结构与工作负载瓶颈的匹配度。

核心内容

方法与数据

价值判断

摘要 Memory for large language model (LLM) agents has rapidly evolved from simple retrieval-augmented mechanisms into a data management system that supports persistent information storage, retrieval, update, consolidation, and dynamic lifecycle governance throughout agent execution. Despite this evolution, existing evaluations still benchmark agent memory mainly through end-to-end task success metrics (e.g., F1, BLEU), while treating the underlying system as a monolithic black box. As a result, critical system-level concerns, including operational costs, architectural trade-offs across memory modules, and robustness under dynamic knowledge updates, remain insufficiently explored. In this paper, we present a systematic experimental study of agent memory from a data management perspective. We propose an analytical framework that decomposes agent memory into four core modules: memory representation and storage, extraction, retrieval and routing, and maintenance. Under this framework, we evaluate 12 representative memory systems and two reference baselines across five benchmark workloads spanning 11 datasets. Our extensive end-to-end evaluation shows that no single architecture dominates across all scenarios; instead, effectiveness depends heavily on how well the memory structure aligns with the workload bottleneck. Furthermore, through fine-grained ablation studies, we quantify their individual effects on representation fidelity, retrieval precision, update correctness, and long-horizon stability. Finally, we reveal cost-performance trade-offs under realistic workloads, showing localized maintenance is more cost-efficient than global reorganization. Based on these findings, we identify promising directions towards building truly agent-native memory systems. The code is publicly available at https://github.com/OpenDataBox/MemoryData.