arXiv AI By Ziru Chen, Dongdong Chen, Ruinan Jin, Yingbin Liang, Yujia Xie, Huan Sun

COBALT: Contextual Bandit Learning with Offline Trajectories for Multi-Turn Code Generation

Read the original on arXiv AI →

COBALT is a contextual bandit learning method that reuses offline multi-turn code generation trajectories to train large language models efficiently. It treats multi-turn code generation as a one-step recoverable Markov decision process, collecting partial trajectories from a reference LLM and training the target model to complete each partial trajectory in a single step. Experiments on LiveCodeBench show that COBALT improves Pass@1 scores for R1-Distill 8B and Qwen3 8B by up to 9.0 and 6.2 points, matches the performance of two online RL baselines, and enhances robustness against misleading execution feedback.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Hugging Face Trending Papers
Jun 10

Breaking Entropy Bounds: Accelerating RL Training via MTP with Rejection Sampling

Reinforcement learning (RL) has become a key component in modern large language models, yet the rollout stage remains the key bottleneck in RL training pipelines. Although Multi-Token Prediction (MTP) offers a natural solution to accelerate rollouts through speculative decoding, many studies have observed that MTP acceptance rates degrade significantly during RL training, leading to limited speedup performance.

arXiv Machine Learning
Jun 11

Breaking Entropy Bounds: Accelerating RL Training via MTP with Rejection Sampling

arXiv:2606. 12370v1 Announce Type: new Abstract: Reinforcement learning (RL) has become a key component in modern large language models, yet the rollout stage remains the key bottleneck in RL training pipelines.

By Yucheng Li, Huiqiang Jiang, Yang Xu, Jianxin Yang, Yi Zhang, Yizhong Cao, Yuhao Shen, Fan Zhou, Rui Men, Jianwei Zhang, An Yang, Bowen Yu, Bo Zheng, Fei Huang, Junyang Lin, Dayiheng Liu, Jingren Zhou
arXiv AI
Aug 20

RTPO: Reverse-Turn Policy Optimization for Stabilizing Agentic RL Training

The paper introduces Reverse‑Turn Policy Optimization (RTPO), a method that restructures multi‑turn agentic reinforcement learning rollouts into sparse reverse trees and updates policies in temporal reverse order. This approach addresses three key instability sources—context mismatch, weak turn‑level credit assignment, and asynchronous policy drift—by aligning each decision with its downstream continuation. Theoretical analysis shows RTPO eliminates context mismatch and drift, reduces credit bias, and converges to recursive optimality, while experiments demonstrate performance gains of 21.50% over trajectory‑level and 10.76% over turn‑level baselines on multi‑turn agentic RL benchmarks.

By Yugu Li, Jimmy Cao, Jianglin Qiao, Siyi Hu