Scalable Supervision for Software Agents via Patch Reasoning

arXiv:2510.22775 · cs.CL, cs.SE · Submitted 2025-10-26 · Read on arXiv

cs.CL, cs.SE

Submitted: 2025-10-26

Updated: 2026-08-26

Comments: EMNLP'26 Findings

License: http://creativecommons.org/licenses/by/4.0/

The gist: While language model agents have advanced software engineering, existing test-based supervision is limiting its scalability on real-world issues.

Terminology

Abstract

While language model agents have advanced software engineering, existing test-based supervision is limiting its scalability on real-world issues. The reason is twofold: (1) high-coverage tests are naturally rare in the wild, and (2) building and running test sandbox is heavy and fragile. To unlock supervision scaling, we propose R4P, a reasoning-based method that provides scaffold-agnostic rewards. R4P uses a group-wise training objective, enabling it to verify multiple patches against each other's modification and gain a dense reward for supervising agents without executing tests or relying on specific agent trajectories. R4P achieves 72.2% Acc. for verifying patches from SWE-bench, competitive with proprietary models. To show the downstream practical utility of R4P, we design and train an execution-free scaffold, Mini-SE, with pure RL via R4P. Mini-SE achieves 26.2% Pass@1, showing a 10.0% improvement over the original Qwen3-32B, and can be further improved to 32.8% with R4P for test-time scaling on patch selection. The stable scaling curves illustrate that though imperfect, R4P can still reliably support downstream tasks at scale.

Sources

Related papers