AI觉醒星球
Awakening is here
Knowledge File / AI技能杠杆
2026-06-14 0 浏览 会员

趋势解读:AI coding agents find the right file but,讨论数据集与基础模型

新基准SWE-Explore揭示了AI编码代理在精确代码行定位上的弱点,代理在文件级表现良好,但行覆盖率仅14-19%,更强模型无法改善,而研究系统CoSIL通过代码网络扫描显著提升性能。

SOURCE / AI技能杠杆 MIN / 9 ACCESS / 会员 POST / 2026-06-14 16:54:47

原贴

查看原文
作者:Jonathan Kemper 来源站点:the-decoder.com 原贴时间:

原文

A new benchmark separates code search from the actual fix and exposes a hidden weakness of AI coding agents. They land in the right neighborhood but miss the crucial spots. Until now, AI coding has mostly been judged by the result. Did the agent fix the bug or not? That single metric hides what actually went wrong. Maybe the agent never read the relevant code. Maybe it saw the correct file and still wrote the wrong patch. Either way, the outcome looks the same. An international research team involving Shanghai Jiao Tong University is tackling this blind spot with SWE-Explore. The benchmark only evaluates the first phase of the process. An agent receives a bug description and a software project, then returns a ranked list of code sections it considers relevant. Figuring out which sections truly matter is nearly impossible to do by hand. So the team takes a different approach. For each of the 848 problems in the dataset, at least two successful solution attempts exist from powerful models like GPT-5.4, Gemini 3 Pro, Claude Sonnet 4.6, or Kimi K2.6. From these runs, the researchers extract which files and lines the AI actually examined before fixing the bug. Passages that multiple independent solution paths converge on count as a signal of useful context. They're not strictly required, but strongly indicated. A separate verification step fills in individual key passages, and the team then manually reviews each region again. The dataset draws from 203 open-source projects across ten programming languages. Python dominates with 547 of 848 tasks, followed by Go, JavaScript, and Rust. The comparison pits traditional search methods against five general-purpose coding agents, including Claude Code, Codex, and OpenHands, along with four research systems built specifically for code search. Old-school keyword search barely beats chance. In a case study, the authors show why. A bug description like "RuntimeWarning on Overflow" contains terms that show up far more often in a project's templates and docs than in the actual source code. AI agents pull ahead clearly because they search the project step by step instead of sorting all hits at once. At the file level, the agents do fine. They find the right source file, rank it early, and keep the selection tight. But the moment the test zooms in to individual lines of code, the system falls apart. General coding agents cover only 14 to 19 percent of the lines that actually matter. Throwing a stronger language model at the problem doesn't fix it. The team ran the same agent with six different models from OpenAI, Anthropic, Google, Moonshot, and Zhipu. The GPT family leads, but the pattern holds. File hit rates stay consistently higher than actual line coverage. The various agent architectures land strikingly close to each other. Claude Code, Codex, OpenHands, Mini-SWE-Agent, and AweAgent post nearly identical scores across every metric. The CoSIL research system is the outlier. It scans code as a network of interconnected building blocks and achieves much higher line coverage. Among the specialized localization systems, AutoCodeRover works precisely but stays conservative, while OrcaLoca produces little noise but misses many relevant spots.

中文翻译

一个新的基准将代码搜索与实际修复分离开来,揭示了AI编码代理的一个隐藏弱点。它们能到达正确的区域,但错过了关键点。到目前为止,AI编码大多根据结果来评判。代理是否修复了Bug?这个单一指标掩盖了实际出错的地方。也许代理从未读取相关代码。也许它看到了正确的文件,但仍然写了错误的补丁。无论哪种方式,结果看起来都一样。一个包括上海交通大学在内的国际研究团队正在用SWE-Explore解决这个盲点。该基准只评估过程的第一阶段。代理收到一个Bug描述和一个软件项目,然后返回一个它认为相关的代码段排序列表。手动确定哪些段真正重要几乎是不可能的。因此,团队采取了不同的方法。对于数据集中848个问题中的每一个,至少存在两个来自GPT-5.4、Gemini 3 Pro、Claude Sonnet 4.6或Kimi K2.6等强大模型的成功解决方案。从这些运行中,研究人员提取了AI在修复Bug之前实际检查过的文件和行。多个独立解决方案路径汇聚的段落被视为有用上下文的信号。它们不是严格必需的,但被强烈指示。单独的验证步骤填充了个别关键段落,然后团队手动再次检查每个区域。该数据集来自十个编程语言的203个开源项目。Python在848个任务中占547个,其次是Go、JavaScript和Rust。比较将传统搜索方法与五个通用编码代理(包括Claude Code、Codex和OpenHands)以及四个专门为代码搜索构建的研究系统进行对比。老式的关键词搜索几乎不比随机好。在一个案例研究中,作者展示了原因。像"RuntimeWarning on Overflow"这样的Bug描述包含的术语在项目的模板和文档中出现的频率远高于实际源代码。AI代理明显领先,因为它们逐步搜索项目,而不是一次性对所有结果排序。在文件级别,代理表现不错。它们找到正确的源文件,早期排序,并保持选择紧凑。但当测试深入到单个代码行时,系统崩溃了。通用编码代理只覆盖了实际重要行的14%到19%。使用更强的语言模型并不能解决问题。团队用来自OpenAI、Anthropic、Google、Moonshot和Zhipu的六个不同模型运行了同一个代理。GPT系列领先,但模式保持不变。文件命中率始终高于实际行覆盖率。各种代理架构的得分惊人地接近。Claude Code、Codex、OpenHands、Mini-SWE-Agent和AweAgent在每个指标上几乎都得到相同的分数。CoSIL研究系统是例外。它将代码扫描为互连构建块的网络,并实现了更高的行覆盖率。在专门的定位系统中,AutoCodeRover工作精确但保持保守,而OrcaLoca产生很少的噪声但错过了许多相关位置。

核心信息

新基准SWE-Explore揭示了AI编码代理在精确代码行定位上的弱点,代理在文件级表现良好,但行覆盖率仅14-19%,更强模型无法改善,而研究系统CoSIL通过代码网络扫描显著提升性能。

  • 新基准SWE-Explore分离代码搜索与修复,揭示AI编码代理在行级定位上的短板。
  • 代理文件命中率高,但关键行覆盖率仅14-19%,更强模型无法显著改善。
  • 不同代理架构得分接近,表明当前编码代理策略已局部收敛。
  • CoSIL通过代码网络扫描大幅提升行覆盖率,提供新设计思路。
  • 传统关键词搜索几乎无效,AI代理逐步搜索优势明显但仍有瓶颈。
试看内容

成为会员查看完整内容

你已经看到了这篇内容的前置整理,剩余深度部分仅对会员开放。

详细解读 信息差价值 参考来源
成为会员查看完整内容
上一篇 趋势解读:KPMG fabricated AI case studies in a report,解读最新 AI 进展 下一篇 趋势解读:Microsoft CEO Satya Nadella admits he's a token-maxer,,提升开发者接入体验