ASTOR:基于效用驱动的多任务代码强化学习框架
ASTOR: Multi-Task Code Reinforcement Learning via Utility-Driven Coordination
AI 导读
研究者提出 ASTOR,一个以任务效用为核心的多任务代码强化学习框架,包含层级效用路由数据调度和自适应效用校准策略优化两个模块。在两个主流 LLM、四项编程任务上的实验显示,ASTOR 单模型超越最佳任务专属模型 9.0%-9.5%,超过最强多任务 RL 基线 7.5%-12.8%。该工作已被 NeurIPS 2026 接收。
正文 · 原文
Abstract:Reinforcement learning (RL) with verifiable rewards has proven effective at post-training LLMs for coding, yet deploying separate task-specific specialists incurs costs that scale with the number of tasks, motivating a unified multi-task RL (MTRL) approach. However, existing MTRL methods treat all coding tasks uniformly, relying on fixed data curricula under a shared optimization strategy, ultimately limiting the effectiveness of multi-task training. To address these limitations, we propose ASTOR, a multi-tASk code reinforcement learning framework via uTility-driven coORdination. Centered on task utility, a signal capturing each task learning potential and cross-task synergy, ASTOR comprises two coupled modules: 1) Hierarchical Utility-Routed Data Scheduling module hierarchically allocates training budget and prioritizes informative prompts, steering training toward the most valuable data and 2) Adaptive Utility-Calibrated Policy Optimization module dynamically scales per-task KL regularization, matching update constraints to each tasks current training state. Experiments on two widely-used LLMs across four representative coding tasks demonstrate that ASTOR consistently improves a single model across all tasks, outperforming the best task-specific specialist by 9.0%-9.5% and surpassing the strongest MTRL baseline by 7.5%-12.8%.
| Comments: | Accepted to NeurIPS 2026 |
| Subjects: | Software Engineering (cs.SE); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2605.06111 [cs.SE] |
| (or arXiv:2605.06111v2 [cs.SE] for this version) | |
| https://doi.org/10.48550/arXiv.2605.06111 arXiv-issued DOI via DataCite |
Submission history
From: Yujia Chen [view email]
[v1]
Thu, 7 May 2026 12:24:53 UTC (2,887 KB)
[v2]
Thu, 29 Oct 2026 06:53:51 UTC (2,891 KB)
来源:arXiv cs.AI · arxiv.org