Reinforcement Learning

Bridging Online and Offline RL: Contextual Bandit Learning for Multi-Turn Code Generation

ZZiru ChenDDongdong ChenRRuinan JinYYingbin LiangYYujia XieHHuan Sun
Published
February 3, 2026
Authors
6

Abstract

Recently, there have been significant research interests in training large language models (LLMs) with reinforcement learning (RL) on real-world tasks, such as multi-turn code generation. While online RL tends to perform better than offline RL, its higher training cost and instability hinders wide adoption. In this paper, we build on the observation that multi-turn code generation can be formulated as a one-step recoverable Markov decision process and propose contextual bandit learning with offline trajectories (Cobalt), a new method that combines the benefits of online and offline RL. Cobalt first collects code generation trajectories using a reference LLM and divides them into partial trajectories as contextual prompts. Then, during online bandit learning, the LLM is trained to complete each partial trajectory prompt through single-step code generation. Cobalt outperforms two multi-turn online RL baselines based on GRPO and VeRPO, and substantially improves R1-Distill 8B and Qwen3 8B by up to 9.0 and 6.2 absolute Pass@1 scores on LiveCodeBench. Also, we analyze LLMs' in-context reward hacking behaviors and augment Cobalt training with perturbed trajectories to mitigate this issue. Overall, our results demonstrate Cobalt as a promising solution for iterative decision-making tasks like multi-turn code generation. Our code and data are available at https://github.com/OSU-NLP-Group/cobalt.

Keywords

large language modelsreinforcement learningmulti-turn code generationMarkov decision processcontextual bandit learningoffline trajectoriesGRPOVeRPOPass@1 scoresreward hackingperturbed trajectories

More in Reinforcement Learning

View all
Bridging Online and Offline RL: Contextual Bandit Learning for Multi-Turn Code Generation | Paperchime