- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces C3L, a framework for repository-level code localization that treats candidate exclusion as an explicit learning event. An agent progressively contracts a survivor set using read-only repository evidence. Two potential-based rewards encourage effective contraction while penalizing losses in reachable localization accuracy. Survivor-state grouping supports turn-level credit assignment, while an execution-verified label cache accommodates alternative repairs. Experiments with 4B and 8B models across three Python benchmarks demonstrate improvements over retrained localization baselines. The 4B model achieves 59.61% mean F1 on SWE-bench Verified and enables a 40.40% downstream repair rate. Extensive ablations investigate reward design, credit timing, and computational efficiency.
Critical strengths
- This paper introduces a clear and compelling formulation that makes exclusions observable and directly creditable, addressing an overlooked aspect of repository search.
- This paper demonstrates consistent improvements across three benchmarks and two model sizes, with matched training conditions, multiple seeds, confidence intervals, and downstream repair evaluation.
- This paper provides unusually thorough attribution experiments, including equal-return reward-timing controls, alternative grouping strategies, objective comparisons, and compute-matched evaluations.
Critical weaknesses
- This paper depends on a fixed candidate universe and irreversible pruning, limiting recovery from retrieval misses or premature exclusions. Initial complete reference coverage is only 58.3% on Pro-Python, and increasing the candidate cap improves LocBench performance by 4.98 points.
- This paper provides limited evidence for the alternative-label cache: its localization improvement has a confidence interval crossing zero, downstream repair gains are also statistically inconclusive, and seven of 100 audited labels exploit weak tests.
- This paper evaluates exclusively on Python repositories and two closely related model backbones. Its broader applicability to other languages, model families, and search tasks remains unverified; moreover, survivor signatures omit accumulated evidence, so grouped turns need not represent equivalent decision states.
Questions for authors
NA