paper-with-me

홈 › Papers

From Patches to Trajectories: Privileged Process Supervision for Software-Engineering Agents

2026-05-21 · Murong Ma, Tianyu Chen, Yun Lin, Shuai Lu, Qinglin Zhu, Yeyun Gong, Zhiyong Huang, Peng Cheng, Yan Lu, Jin Song Dong arxiv

Supervised fine-tuning (SFT) on long teacher trajectories is the dominant way to instill investigation and reasoning in open software-engineering (SWE) agents. Since every retained response becomes an imitation target, the student inherits the final outcome and intermediate flaws, including ungrounded leaps and redundant loops. High-quality training data must be effective(each step is grounded and narrows the agent's epistemic gap to the correct fix) and efficient(each step is information-bearing rather than redundant or looping). Existing recipes filter or relabel teacher rollouts using only a binary terminal verifier, which does not directly target these axes and provides no supervision on instances where the teacher fails. Most real issue includes a developer-authored reference patch, $p^\star$, revealing the file paths, runtime behaviors, and coding conventions presupposed by the correct fix, yet standard pipelines discard it. We propose Patches-to-Trajectories (P2T), which uses $p^\star$ as privileged information during curation and formulates trajectory construction as bi-objective optimization over per-step effectiveness and trajectory length. A reverse phase distills $p^\star$ into a latent process graph, $G^\star$, of contextual facts and solution milestones. A forward phase curates trajectories from blinded teacher continuations by scoring per-step progress against $G^\star$ under a leakage-blocking groundedness check and retaining the shortest effective segments. Using only 1.8k curated SWE-Gym instances, P2T improves effectiveness and efficiency over outcome-filtered SFT and its tool-error-masking variant. On SWE-bench Verified, it raises Pass@1 by up to 10.8 points while reducing per-instance inference cost by ~15%, with consistent gains on SWE-bench Lite. Size-matched ablations and qualitative analysis further isolate trajectory quality from data scale.

📄 PDF Abstract BibTeX arXiv:2605.21996

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Scalable Supervision for Software Agents via Patch Reasoning

2025-10-26 · Junjielong Xu, Boyin Tan, Xiaoyuan Liu, Chao Peng 외 arxiv

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 w…

Reinforcement Learning

Latent On-Policy Self-Distillation

2026-08-13 · Guibin Zhang, Jiayang Lyu, Ran Sun, Xinlei Yu 외 arxiv

Enabling agents to learn from experience and internalize it into their policy has become a central problem in self-evolving AI. On-policy self-distillation (OPSD) offers an effective pathway by using a privileged self-te…

Code Generation

Beyond Absolute Imitation: Anchored Residual Guidance for Privileged On-Policy Distillation

2026-06-09 · Wenhao Zhang arxiv

On-policy distillation (OPD) has demonstrated strong empirical gains in enhancing complex reasoning in LLMs by aligning a student model with a teacher's predictive distribution over the student's own trajectories. An eme…

Skill-SD: Skill-Conditioned Self-Distillation for Multi-turn LLM Agents

2026-04-12 · Hao Wang, Guozhi Wang, Han Xiao, Yufeng Zhou 외 arxiv

Reinforcement learning (RL) has been widely used to train LLM agents for multi-turn interactive tasks, but its sample efficiency is severely limited by sparse rewards and long horizons. On-policy self-distillation (OPSD)…

Reinforcement Learning

DOPD: Dual On-policy Distillation

2026-06-29 · Xinlei Yu, Gen Li, Qingyi Si, Guibin Zhang 외 hf

On-policy distillation (OPD) offers superior capacity transfer by supervising student-sampled trajectories with dense token-level signals. To furnish high-quality supervision sources and thereby elevate the performance f…

Continual Learning