Skip to content

Beyond Policy Rollouts: Embedding-Space Directional Exploration with Anchored Noise for LLM RLVR

Oct 2026 · 0 citations · 41 references
Computer Science

TL;DR

This paper proposes EDEN (Embedding-space Directional Exploration via anchored Noise), which intervenes at the rollout source through anchored input perturbations and outperforms GRPO and the exploration controls evaluated in the same pipeline, with the largest gains in sampled solution coverage.

Abstract

Reinforcement learning with verifiable rewards (RLVR) typically uses small rollout groups per prompt, where repeated sampling from the same policy can yield highly similar trajectories, reducing within-group reward variation and weakening group-relative advantage signals. Existing remedies such as higher sampling temperature, entropy bonuses, asymmetric clipping, and larger rollout budgets broaden sampling or modify policy updates but leave rollout conditioning unchanged. In this paper, we propose EDEN (Embedding-space Directional Exploration via anchored Noise), which intervenes at the rollout source through anchored input perturbations. EDEN explores beyond the policy's own rollouts. Within the same rollout budget, it replaces a small fraction of standard rollouts in each group with rollouts that the same policy generates from the prompt plus a single appended, perturbed embedding position, rather than from the prompt alone. Gaussian noise drives variation, while a shared anchor provides a common conditioning direction within each prompt group. Selected perturbed rollouts contribute to GRPO updates with downweighted advantages, and the model architecture, discrete decoding, and test-time inference remain unchanged. Across model scales and mathematical reasoning benchmarks, EDEN outperforms GRPO and the exploration controls evaluated in the same pipeline, with the largest gains in sampled solution coverage. Analyses show that more prompt groups provide non-zero group-relative learning signals and that noise and anchoring play complementary roles. Intervening at the rollout source is thus an effective lever for exploration in RLVR.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

GRPODropout: Less is More for Online Reinforcement Learning Rollouts

Reinforcement learning (RL) methods such as GRPO substantially improve large language model reasoning but often suffer from policy entropy collapse: the loss of sampling diversity weakens exploration and limits further improvement. Existing methods address this issue either through algorithm-level interventions, such a...

Hexuan Deng, Zi-Hao Yan, Xue-Bo Liu et al. · 1 citation
#artificial intelligence Preprint Oct 2026

Exploration via Activation-Space Steering for Reinforcement Learning with Verifiable Rewards

This work introduces Activation-Space Exploration (ASE), an online method for diversifying training rollouts that builds a structured bank of latent exploration vectors by clustering activation differences between correct and incorrect responses to the same problem.

Yu-Nan Zeng, Jin-Hao Jing, Xi Cheng et al. · 0 citations
Preprint Oct 2026

Dataset Mismatch Matters in Group Relative Policy Optimization for Reinforcement Learning from Verifiable Rewards

Recently, reinforcement learning from verifiable rewards (RLVR) is practically very important, where the leading approach is group relative policy optimization (GRPO) that typically faces a trade-off between rollout efficiency and downstream performance. To improve efficiency while preserving performance, existing sele...

Zhen-Yu Zhang, Jian-Dong Zhang, Hua-Xiu Yao et al. · 1 citation

Cross-Rollout Bellman Closure for Long-Horizon Agentic Reinforcement Learning

Cross-Rollout Bellman Closure (CRBC) is introduced, which merges each rollout group into a finite empirical process with absorbing success and failure boundaries and evaluates its behavior-policy Bellman fixed point with one linear solve.

Yang-Yang Ren, Hao-Dong Zhu, Lin-Lin Yang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Follow the Winners: Conservative Policy Improvement with the Cross-Entropy Method for Critic-Free RFT

Critic-free reinforcement fine-tuning (RFT) for agentic large language models is often done through GRPO-style methods, which compute a group baseline over repeated rollouts to reduce target variance. However, this setup is ill-suited to agents acting in stateful environments such as live services or security sandboxes...

Joery A. de Vries, Neil D. Lawrence, Zhen-Wen Dai · 0 citations
Preprint Oct 2026

Routing Policy Optimization for Online Diffusion Reinforcement Learning

Reinforcement learning can align visual generators with reward signals beyond their pretraining objectives, but existing score-function methods typically introduce stochasticity by perturbing the reverse denoising trajectory, leading to costly rollout-based optimization. We instead ask whether stochastic exploration ca...

Qiuhong Shen, Yiding Yang, Yu-Xin Zhang et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.