Cost-Effective Repository Exploration for Agentic Issue Localization

📅 2026-08-30
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
研究通过使用低成本模型进行代码仓库探索以定位问题文件,同时保持高质量定位。实验表明,低成本模型可以大幅减少时间和成本,同时保留大部分性能。
📝 Abstract
Repository exploration is a distinct and costly stage of coding-agent pipelines: before generating a patch, an agent must identify which repository files are likely to matter. We study whether this stage can be delegated to lower-cost models while retaining useful localization quality. Using our IssueLoc-Bench, we evaluate five explorer models under the same read-only interactive interface on 499 SWE-bench Verified-derived tasks and 500 tasks from 153 additional repositories. We measure early candidate discovery, top-three gold-file coverage, strict file-set recovery, agent time, and token usage, with paired instance-level uncertainty and repository-clustered sensitivity analysis. The highest-quality explorer leads across localization metrics, but substantially cheaper operating points emerge: depending on the model and evaluation arm, lower-cost explorers retain approximately 78-94% of the reference Hit@3 and 73-92% of its F1 while reducing mean agent time by 41-88% and token usage by 84-95%. The preferred operating point depends on how localization is consumed downstream: ranking and coverage metrics characterize recoverable candidate handoffs, whereas F1 and exact match characterize restrictive file gates. These results support treating repository exploration as an independently measurable and budgetable stage of modular coding agents, with explorer selection guided by the downstream handoff contract.
Problem

Research questions and friction points this paper is trying to address.

Cost-Effective
Repository Exploration
Agentic Issue Localization
Coding-Agent Pipelines
Low-Cost Models
Innovation

Methods, ideas, or system contributions that make the work stand out.

Cost-Effective Repository Exploration
Localization Quality
Lower-Cost Models
Token Usage
Agent Time
🔎 Similar Papers
No similar papers found.