@inproceedings{aggarwal-etal-2025-dars,
    title = "{DARS}: Dynamic Action Re-Sampling to Enhance Coding Agent Performance by Adaptive Tree Traversal",
    author = {Aggarwal, Vaibhav  and
      Kamal, Ojasv  and
      Japesh, Abhinav  and
      Jin, Zhijing  and
      Sch{\"o}lkopf, Bernhard},
    editor = "Che, Wanxiang  and
      Nabende, Joyce  and
      Shutova, Ekaterina  and
      Pilehvar, Mohammad Taher",
    booktitle = "Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)",
    month = jul,
    year = "2025",
    address = "Vienna, Austria",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingestion-acl-25/2025.acl-long.973/",
    pages = "19808--19855",
    ISBN = "979-8-89176-251-0",
    abstract = "Large Language Models (LLMs) have revolutionized various domains, including natural language processing, data analysis, and software development, by enabling automation. In software engineering, LLM-powered coding agents have garnered significant attention due to their potential to automate complex development tasks, assist in debugging, and enhance productivity. However, existing approaches often struggle with sub-optimal decision-making, requiring either extensive manual intervention or inefficient compute scaling strategies. To improve coding agent performance, we present Dynamic Action Re-Sampling (DARS), a novel inference time compute scaling approach for coding agents, that is faster and more effective at recovering from sub-optimal decisions compared to baselines. While traditional agents either follow linear trajectories or rely on random sampling for scaling compute, our approach DARS works by branching out a trajectory at certain key decision points by taking an alternative action given the history of the trajectory and execution feedback of the previous attempt from that point. We evaluate our approach on SWE-Bench Lite benchmark, demonstrating that this scaling strategy achieves a pass@k score of 55{\%} with Claude 3.5 Sonnet V2. Our framework achieves a pass@1 rate of 47{\%}, outperforming state-of-the-art (SOTA) open-source frameworks."
}