atlas

Research map / Multi-agent systems and games / LLM agents

SWE-Search: Enhancing Software Agents with Monte Carlo Tree Search and Iterative Refinement

ICLR 2025 · Multi-agent systems and games › LLM agents · approach: Robust and efficient agent execution · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes SWE-Search, a multi-agent framework combining MCTS with an LLM hybrid value function (numeric score plus natural-language feedback) and a debate-based discriminator, improving SWE-bench Lite resolve rates by about 23% relative across five models.

Problem

LLM software agents follow linear, sequential processes that prevent backtracking and exploration of alternative solutions, limiting performance on repository-level software engineering tasks.

Approach

Applies MCTS to a moatless-tools style software agent with a git-based commit tree for reverting states, using an LLM value agent that outputs both a numeric value and a natural-language explanation fed back into re-expansion (hindsight feedback), plus a multi-agent debate discriminator to select the final patch. The selection function is heuristic (UCT with depth bonus and penalty) rather than LL

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add MCTS search and iterative value feedbackMoatless-Adapted with GPT-4o · SWE-bench Literesolve rate (Pass@1): 25.7 -> 31.0Helped
Add MCTS search and iterative value feedbackMoatless-Adapted with GPT-4o-mini · SWE-bench Literesolve rate (Pass@1): 13.0 -> 17.0Helped
Add MCTS search and iterative value feedbackMoatless-Adapted with Qwen2.5-72B-Instruct · SWE-bench Literesolve rate (Pass@1): 18.0 -> 24.7Helped
Add MCTS search and iterative value feedbackMoatless-Adapted with DeepSeek-V2.5 · SWE-bench Literesolve rate (Pass@1): 16.3 -> 21.0Helped
Add MCTS search and iterative value feedbackMoatless-Adapted with Llama-3.1-70B-Instruct · SWE-bench Literesolve rate (Pass@1): 13.6 -> 17.7Helped
Allow Plan states to transition to any state type (ablation)Moatless-Adapted · SWE-bench Literesolve rate (Pass@1): 24.3 -> 25.7Mixed
Add MCTS and search-and-feedback to flexible state transitionsMoatless-Adapted · SWE-bench Literesolve rate (Pass@1): 25.7 -> 31.0Helped
Add a structured multi-agent discriminator debate for final solution selection (ablation)SWE-Search · SWE-bench Litecorrect final-solution selection: 73% -> 84%Helped
Use state-specific value prompts for Searching, Planning, and Editing (ablation)SWE-Search Value Agent · SWE-bench Litevalue assessment of effective statesHelped

Surprising findings

Limitations

Experimental setup

Datasets: SWE-bench Lite

Benchmarks: SWE-bench Lite

Metrics: Pass@1 resolve rate Pass@5 relative improvement

Baselines: Moatless-v0.0.2 Moatless-Adapted SWE-agent Agentless AutoCodeRover OpenDevin

Builds on: moatless-tools SWE-bench AlphaZero UCT

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy