mlsanityData to 14 Oct 2026

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

arXiv 2610.16105 ↗First posted 12 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 41 references that are in the map. First posted on arXiv 12 Oct 2026.

Builds on

37 of 41 references.

References · 37

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  4. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  5. 2024Qwen2.5 Technical Reportcited by 4,942
  6. 2023Let's Verify Step by Stepcited by 3,789
  7. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
  8. 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,392
  9. 2024OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problemscited by 1,136
  10. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,090
  11. 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 982
  12. 2025The Entropy Mechanism of Reinforcement Learning for Reasoning Language Modelscited by 485
25 more
  1. 2025Reinforcement Learning with Verifiable Rewards Implicitly Incentivizes Correct Reasoning in Base LLMscited by 289
  2. 2025ProRL: Prolonged Reinforcement Learning Expands Reasoning Boundaries in Large Language Modelscited by 194
  3. 2023Evaluating the Performance of Large Language Models on GAOKAO Benchmarkcited by 186
  4. 2025Pass@k Training for Adaptively Balancing Exploration and Exploitation of Large Reasoning Modelscited by 138
  5. 2025Act Only When It Pays: Efficient Reinforcement Learning for LLM Reasoning via Selective Rolloutscited by 113
  6. 2025CPPO: Accelerating the Training of Group Relative Policy Optimization-Based Reasoning Modelscited by 96
  7. 2025Improving Data Efficiency for LLM Reinforcement Fine-tuning Through Difficulty-targeted Online Data Selection and Rollout Replaycited by 56
  8. 2025Can Prompt Difficulty be Online Predicted for Accelerating RL Finetuning of Reasoning Models?cited by 52
  9. 2025Depth-Breadth Synergy in RLVR: Unlocking LLM Reasoning Gains with Adaptive Explorationcited by 43
  10. 2025Diversity-Aware Policy Optimization for Large Language Model Reasoningcited by 41
  11. 2025FlowRL: Matching Reward Distributions for LLM Reasoningcited by 40
  12. 2025RLEP: Reinforcement Learning with Experience Replay for LLM Reasoningcited by 39
  13. 2025Soft Tokens, Hard Truthscited by 35
  14. 2025Improving Sampling Efficiency in RLVR through Adaptive Rollout and Response Reusecited by 29
  15. 2025SofT-GRPO: Surpassing Discrete-Token LLM Reinforcement Learning via Gumbel-Reparameterized Soft-Thinking Policy Optimizationcited by 21
  16. 2025Towards High Data Efficiency in Reinforcement Learning with Verifiable Rewardcited by 19
  17. 2026Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewardscited by 17
  18. 2025QeRL: Beyond Efficiency -- Quantization-enhanced Reinforcement Learning for LLMscited by 16
  19. 2025Making Small Language Models Efficient Reasoners: Intervention, Supervision, Reinforcementcited by 14
  20. 2025Lookahead Tree-Based Rollouts for Enhanced Trajectory-Level Exploration in Reinforcement Learning with Verifiable Rewardscited by 13
  21. 2025VADE: Variance-Aware Dynamic Sampling via Online Sample-Level Difficulty Estimation for Multimodal RLcited by 11
  22. 2026Temperature as a Meta-Policy: Adaptive Temperature in LLM Reinforcement Learningcited by 8
  23. 2025Soft Reasoning: Navigating Solution Spaces in Large Language Models through Controlled Embedding Explorationcited by 7
  24. 2026Learning to Explore with Parameter-Space Noise: A Deep Dive into Parameter-Space Noise for Reinforcement Learning with Verifiable Rewardscited by 6
  25. 2026A Relative-Budget Theory for Reinforcement Learning with Verifiable Rewards in Large Language Model Reasoningcited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Parameter Exploration for RLVR via Variational Learning
  2. 2026SALT: When More Rollouts Don't Help in Group-Based Policy Optimization and How to Make Them Matter
  3. 2026Early Verdicts, Better Budgets: Sequential Adaptive Rollout Allocation for Compute-Efficient RLVR
  4. 2026PAIR: Pairwise-Aware Inclusion Reweighting for Adaptive Rollout Allocation in RLVR
  5. 2026RL2ML: Finite-Rollout Surrogate Objectives from Reinforcement Learning to Maximum Likelihood
  6. 2026Where Rollouts Begin: Low-Load, High-Leverage First-Token Diversification for RLVR
  7. 2025EEPO: Exploration-Enhanced Policy Optimization via Sample-Then-Forget
  8. 2026Contextual Rollout Bandits for Reinforcement Learning with Verifiable Rewards