Pith. sign in

REVIEW 7 cited by

Thinking Longer, Not Larger: Enhancing Software Engineering Agents via Scaling Test-Time Compute

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.23803 v2 pith:P4NKPEL6 submitted 2025-03-31 cs.SE cs.AI

classification cs.SEcs.AI
keywords modelsagentslargerreasoningscalingsoftwaretest-timetextit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent advancements in software engineering agents have demonstrated promising capabilities in automating program improvements. However, their reliance on closed-source or resource-intensive models introduces significant deployment challenges in private environments, prompting a critical question: \textit{How can personally deployable open-source LLMs achieve comparable code reasoning performance?} To this end, we propose a unified Test-Time Compute scaling framework that leverages increased inference-time computation instead of larger models. Our framework incorporates two complementary strategies: internal TTC and external TTC. Internally, we introduce a \textit{development-contextualized trajectory synthesis} method leveraging real-world software repositories to bootstrap multi-stage reasoning processes, such as fault localization and patch generation. We further enhance trajectory quality through rejection sampling, rigorously evaluating trajectories along accuracy and complexity. Externally, we propose a novel \textit{development-process-based search} strategy guided by reward models and execution verification. This approach enables targeted computational allocation at critical development decision points, overcoming limitations of existing "end-point only" verification methods. Evaluations on SWE-bench Verified demonstrate our \textbf{32B model achieves a 46\% issue resolution rate}, surpassing significantly larger models such as DeepSeek R1 671B and OpenAI o1. Additionally, we provide the empirical validation of the test-time scaling phenomenon within SWE agents, revealing that \textbf{models dynamically allocate more tokens to increasingly challenging problems}, effectively enhancing reasoning capabilities. We publicly release all training data, models, and code to facilitate future research. https://github.com/yingweima2022/SWE-Reasoner

Discussion (0). Sign in to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Historical Patches to Repair Plans: Outcome-Conditioned Reasoning for Repository-Level Program Repair

    cs.SE 2026-01 conditional novelty 6.0 of 10

    Backward reasoning distilled from a repository's already-fixed issues, injected as prompts, lifts LLM repair success on SWE-Bench Lite by up to 10.4 Pass@1 points.

  2. TN-AutoRCA: Benchmark Construction and Agentic Framework for Self-Improving Alarm-Based Root Cause Analysis in Telecommunication Networks

    cs.CL 2025-07 conditional novelty 6.0 of 10

    A new 530-scenario benchmark for telecom alarm root cause analysis, plus an iterative agent that lifts F1 from 58.99% to 91.79% by repeatedly repairing its code against the benchmark.

  3. Skywork-SWE: Unveiling Data Scaling Laws for Software Engineering in LLMs

    cs.AI 2025-06 conditional novelty 6.0 of 10

    Training on more validated GitHub issue-fix trajectories steadily raises SWE-bench Verified pass@1 from 6.4% to 38.0%, with 47.0% after test-time scaling, and no plateau yet.

  4. Satori-SWE: Evolutionary Test-Time Scaling for Sample-Efficient Software Engineering

    cs.CL 2025-05 conditional novelty 6.0 of 10

    A 32B model trained to self-evolve patch candidates through RL reaches 41.6% on SWE-Bench Verified with 50 samples, comparable to a 70B model using 500 samples.

  5. Socratic-PRMBench: Benchmarking Process Reward Models with Systematic Reasoning Patterns

    cs.AI 2025-05 conditional novelty 6.0 of 10

    Socratic-PRMBench tests process reward models on deliberately flawed math reasoning across six reasoning patterns and reports that current PRMs score below LLM critics.

  6. Revisiting Test-Time Scaling: A Survey and a Diversity-Aware Method for Efficient Reasoning

    cs.CL 2025-06 conditional novelty 5.0 of 10

    ADAPT, a diversity-aware prefix fine-tuning method, improves best-of-N sampling efficiency for a 1.5B reasoning model, reaching 80% accuracy at N=32 versus N=256 for the baseline.

  7. ReasonBridge: Efficient Reasoning Transfer from Closed to Open-Source Language Models

    cs.AI 2025-06 conditional novelty 4.0 of 10

    ReasonBridge distills 1,000 curated reasoning traces from a closed model into open-source models via hierarchical adapters and guided inference, claiming up to 23% benchmark gains.

Pith tools