Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research introduces CodeTriage, a learned policy that optimizes the search process for LLM-based code repair by predicting necessary revision steps before generating new code. By leveraging test failure details and proposed edits, the method reduces program revisions by 21% and output tokens by 12% compared to baselines, significantly improving efficiency without retraining on specific models. The release of a massive corpus containing over 12 million program versions organized into repair trees offers valuable data for advancing automated software engineering workflows.
Sources coveringarXiv, itbusinessnet.com, Quantum Zeitgeist, The Verge
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Make Every Expansion Count: Learning to Search Efficiently in LLM Code Repair

arXiv2 min read

arXiv:2610.15894v1 Announce Type: cross Abstract: Large language model (LLM) code-repair systems fix faulty programs by repeatedly generating and testing revisions. Each revision is costly, making the choice of which repair to pursue important for efficiency. Existing search policies rely on test pass rates and search statistics, ignoring the details of test failures and proposed edits. We introduce CodeTriage, a learned policy that prioritizes edits before their revised programs are generated and tested. Its 0.6B-parameter model reads the test output, failure diagnosis, and proposed edit, then predicts a distribution over the number of repair steps needed to reach a fix through that edit. These predictions prioritize all pending edits across programs before generating and testing the revised code. On held-out repair tasks, CodeTriage finds fixes with 21% fewer program revisions and 12% fewer output tokens than the strongest baseline on each metric. Without retraining, it achieves the highest average success across search budgets for each of 11 unseen repair LLMs. Ablations show that both the failure context and edit text, as well as comparisons across programs, improve search. We also release a corpus of 12.2 million program versions from four LLMs, organized into repair trees with proposed edits and test results.

Abstract:Large language model (LLM) code-repair systems fix faulty programs by repeatedly generating and testing revisions. Each revision is costly, making the choice of which repair to pursue important for efficiency. Existing search policies rely on test pass rates and search statistics, ignoring the details of test failures and proposed edits. We introduce CodeTriage, a learned policy that prioritizes edits before their revised programs are generated and tested. Its 0.6B-parameter model reads the test output, failure diagnosis, and proposed edit, then predicts a distribution over the number of repair steps needed to reach a fix through that edit. These predictions prioritize all pending edits across programs before generating and testing the revised code. On held-out repair tasks, CodeTriage finds fixes with 21% fewer program revisions and 12% fewer output tokens than the strongest baseline on each metric. Without retraining, it achieves the highest average success across search budgets for each of 11 unseen repair LLMs. Ablations show that both the failure context and edit text, as well as comparisons across programs, improve search. We also release a corpus of 12.2 million program versions from four LLMs, organized into repair trees with proposed edits and test results.

Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Software Engineering (cs.SE)

arXiv:2610.15894 [cs.LG]

(or arXiv:2610.15894v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.15894 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 295 words

Related coverage