paper-with-me

Papers

Context Bootstrapped Reinforcement Learning

2026-03-19 · Saaket Agashe, Jayanth Srinivasa, Gaowen Liu, Ramana Kompella, Xin Eric Wang arxiv

Reinforcement Learning from Verifiable Rewards (RLVR) suffers from exploration inefficiency, where models struggle to generate successful rollouts, resulting in minimal learning signal. This challenge is particularly severe for tasks that require the acquisition of novel reasoning patterns or domain-specific knowledge. To address this, we propose Context Bootstrapped Reinforcement Learning (CBRL), which augments RLVR training by stochastically prepending few-shot demonstrations to training prompts. The injection probability follows a curriculum that starts high to bootstrap early exploration, then anneals to zero so the model must ultimately succeed without assistance. This forces the policy to internalize reasoning patterns from the demonstrations rather than relying on them at test time. We validate CBRL across two model families and five Reasoning Gym tasks. Our results demonstrate that CBRL consistently improves success rate, provides better exploration efficiency, and is algorithm-agnostic. We further demonstrate CBRL's practical applicability on Q, a domain-specific programming language that diverges significantly from mainstream language conventions.

📄 PDF Abstract BibTeX arXiv:2603.18953

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Bootstrapped Q-learning with Context Relevant Observation Pruning to Generalize in Text-based Games

2020-09-24 · EMNLP 2020 11 · Subhajit Chaudhury, Daiki Kimura, Kartik Talamadupula, Michiaki Tatsubori 외

We show that Reinforcement Learning (RL) methods for solving Text-Based Games (TBGs) often fail to generalize on unseen games, especially in small data regimes. To address this issue, we propose Context Relevant Episodic…

Q-LearningReinforcement Learning (RL)text-based games

Deep Exploration via Bootstrapped DQN

2016-02-15 · NeurIPS 2016 12 · Ian Osband, Charles Blundell, Alexander Pritzel, Benjamin Van Roy

Efficient exploration in complex environments remains a major challenge for reinforcement learning. We propose bootstrapped DQN, a simple algorithm that explores in a computationally and statistically efficient manner th…

Atari GamesEfficient Explorationreinforcement-learningReinforcement Learning+1

Optimistic Exploration with Backward Bootstrapped Bonus for Deep Reinforcement Learning

2021-01-01 · Chenjia Bai, Lingxiao Wang, Peng Liu, Zhaoran Wang 외

Optimism in the face of uncertainty is a principled approach for provably efficient exploration for reinforcement learning in tabular and linear settings. However, such an approach is challenging in developing practical …

Atari GamesDeep Reinforcement LearningEfficient ExplorationQ-Learning+3

Improving the Diversity of Bootstrapped DQN by Replacing Priors With Noise

2022-03-02 · Li Meng, Morten Goodwin, Anis Yazidi, Paal Engelstad

Q-learning is one of the most well-known Reinforcement Learning algorithms. There have been tremendous efforts to develop this algorithm using neural networks. Bootstrapped Deep Q-Learning Network is amongst them. It uti…

Atari GamesDiversityQ-Learning

Bootstrapped model learning and error correction for planning with uncertainty in model-based RL

2020-04-15 · Alvaro Ovalle, Simon M. Lucas

Having access to a forward model enables the use of planning algorithms such as Monte Carlo Tree Search and Rolling Horizon Evolution. Where a model is unavailable, a natural aim is to learn a model that reflects accurat…

modelReinforcement Learning