Skip to content

Boosting LLM Exploration via Weak-Model Guidance in RLVR

Aug 2026 · 2 citations · ⚡ 1 influential · 29 references
Computer Science

TL;DR

This work empirically study the potential of outer prefixes, revealing the mechanism of the impact of distributional discrepancy to the exploration dynamics in RLVR training and efficiently mitigates entropy collapse without requiring additional SFT, intricate reward designs, or complex prompting.

Abstract

Reinforcement Learning with Verifiable Rewards (RLVR) significantly improves LLM reasoning but often causes a drop in policy entropy, leading to narrowed reasoning coverage and degraded pass@$k$ for large $k$. While existing methods mitigate this entropy collapse through algorithmic regularizations, cross-model non-parametric perturbation is also neglected. In this work, we propose a simple yet effective approach to preserve the generative diversity of LLMs during RLVR. Instead of relying solely on internal exploration, we force the target model to generate answers based on partial reasoning trajectories generated by a smaller, weaker language models. These unfamiliar prefixes effectively disrupt over-confidence and encourage the exploration of distinct reasoning paths. We empirically study the potential of outer prefixes, revealing the mechanism of the impact of distributional discrepancy to the exploration dynamics in RLVR training. Experiments across multiple mathematical benchmarks show that our method consistently outperforms vanilla RLVR. Notably, the performance gain becomes increasingly pronounced as $k$ scales up, demonstrating a substantial expansion of reasoning coverage. Furthermore, our approach efficiently mitigates entropy collapse without requiring additional SFT, intricate reward designs, or complex prompting.

View source

Similar papers

Dissecting Reinforcement Learning: Mechanisms Behind Compositional Reasoning in LLMs

This thesis proposes a unified two-axis framework that organizes SFT and RL methods along a data axis (off-policy to on-policy) and a loss function axis (positive-only to positive-plus-negative to GRPO) and enables controlled ablations of individual components.

G. Kim, Chair Chenyan Xiong, Aditi Raghunathan · 0 citations
Jul 2026

Contrastive Reinforced Policy Optimization via Privileged Self-Distillation

Contrastive Reinforced Policy Optimization (CRPO) is introduced, which reformulates agentic OPSD from a contrastive learning perspective, and conducts group-wise contrast to preserve reliable, fine-grained optimization signals.

Xingjian Wu, Junlin Liu, Xing-Chen Liu et al. · 2 citations
Jul 2026

When RLVR Shrinks the Reasoning Boundary: Diagnosing Pass@k Inversion

Per-Problem Base Anchoring is a deliberately simple proof-of-concept that improves both high-budget coverage over matched GRPO and ECCV-relevant vision-language agents when repeated visual, spatial, or chart-reasoning attempts are checked by external tools or verifiers.

Todd Y. Zhou · 0 citations

VEG: Verbal ϵ -greedy for Semantic Exploration in Multi-Turn RL Agents

This work proposes VEG (verbal ϵ -greedy), a novel framework that leverages external feedback as a dynamic control variable to explicitly balance exploration and exploitation within the semantic space and achieves superior accuracy compared to standard RL baselines.

Yongchang Hao, Jie Hao, Yongsheng Mei et al. · 0 citations
Jul 2026

ARMOR: Stabilizing On-Policy LLM RL with Off-Policy Anchor Samples

This work proposes ARMOR (Anchor Rollout and Mixed Optimization for RL), a framework that shifts the paradigm from passive penalty to active sample stabilization, enabling sustained performance improvements over extended training horizons.

Kexin Huang, Junkang Wu, Jinda Lu et al. · 0 citations
Book Open access Aug 2026

ANCHOR: Taming Entropy Dynamics for Stable and Efficient Reasoning of Large Language Models

Reinforcement Learning with Verifiable Rewards (RLVR) has become a standard approach for improving complex reasoning in Large Language Models (LLMs). However, entropy collapse remains a critical bottleneck, often leading to performance degradation. While typically attributed to reduced exploration, we identify a more s...

Cong Qin, Jiaye Lin, Xiaoliang Fu et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

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