Parameter Exploration for RLVR via Variational Learning
Summary
This paper introduces Perturbed Parameter Policy Optimization (3PO), a family of parameter-space exploration methods for LLM reinforcement learning, showing consistent improvements over GRPO on math and code tasks.
View Cached Full Text
Cached at: 08/13/26, 03:32 PM
Paper page - Parameter Exploration for RLVR via Variational Learning
Source: https://huggingface.co/papers/2608.09805
https://huggingface.co/login?next=%2Fpapers%2F2608.09805- ![]()
Abstract
Parameter-space exploration via perturbed policy sampling improves LLM reinforcement learning by diversifying rollouts and reducing training failures compared to action-space methods.
Exploration has been a focus of reinforcement learning research for a long time. Recently, there has been growing evidence that it is also an important ingredient inLLM reinforcement learningrecipes that can significantly impact downstream performance. Many existing methods control exploration in the action-space, for example, usingtemperature scaling. However, these methods cannot reorder tokens but only influence the variance in the output distribution. This limits exploration and can lead to divergence or stalled training. Here, we investigateparameter-space exploration, where rollouts are generated by sampling different policies from a posterior that may each explore different rollouts. Sampling less or more diverse policies is then a complementary control lever over exploration. We introduce a family of methods calledPerturbed Parameter Policy Optimization (3PO)which use different sampling strategies and differentrollout groupingforreward estimation. Experiments on OLMo-3-1025-7B and Qwen2.5-Math-7B across mathematical reasoning and code generation tasks show that these approaches consistently improve average downstream performance over standardGRPOat a near-identical FLOPs cost. Moreover, using multiple parameter samples consistently produces fewerzero-advantage groupsand malformed or incorrect rollouts during training thanGRPOand action-space baselines. Overall, our work presents evidence thatparameter-space explorationcan improve reinforcement learning for LLMs.
View arXiv pageView PDFGitHub0Add to collection
Community
Paper submitter
Parameter Exploration for RLVR via Variational Learning
Upload images, audio, and videos by dragging in the text input, pasting, orclicking here.
Tap or paste here to upload images
https://huggingface.co/login?next=%2Fpapers%2F2608.09805- ![]()
Get this paper in your agent:
hf papers read 2608\.09805
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper14
#### BayesRL/Qwen2.5Math-IVON-SFT-7B Text Generation• 8B• Updatedabout 5 hours ago • 519
#### BayesRL/Olmo3-IVON-SFT-7B Text Generation• 7B• Updatedabout 5 hours ago • 4.4k
#### BayesRL/Olmo3-B3PO-7B Text Generation• 7B• Updatedabout 5 hours ago • 9
#### BayesRL/Olmo3-M3PO-7B Text Generation• 7B• Updatedabout 5 hours ago • 6
Browse 14 models citing this paper## Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2608.09805 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2608.09805 in a Space README.md to link it from this page.
Collections including this paper1
Similar Articles
DiPO: Disentangled Perplexity Policy Optimization for Fine-grained Exploration-Exploitation Trade-Off
DiPO introduces a novel reinforcement learning approach for LLMs that uses perplexity-based sample partitioning to disentangle exploration and exploitation subspaces, combined with a bidirectional reward allocation mechanism for more stable policy optimization. The method demonstrates superior performance on mathematical reasoning and function calling tasks.
Beyond Euclidean Clipping: Overcoming Exploration Collapse in LLM RL via Riemannian Isometric Policy Optimization
This paper reveals that PPO-Clipping's use of Euclidean metric causes exploration collapse in LLM RL, and proposes Riemannian Isometric Policy Optimization (RIPO) to ensure geometrically consistent policy updates, achieving up to 60% improvement over GRPO on AIME24.
Listwise Policy Optimization: Group-based RLVR as Target-Projection on the LLM Response Simplex
This paper introduces Listwise Policy Optimization (LPO), a method for RLVR that explicitly handles target projection via divergence minimization on the response simplex to improve training stability and performance in LLMs.
Vector Policy Optimization: Training for Diversity Improves Test-Time Search
This paper introduces Vector Policy Optimization (VPO), a reinforcement learning algorithm that trains LLMs to produce diverse solutions by optimizing across multiple reward dimensions, significantly improving test-time search performance compared to scalar RL baselines.
Gradient Extrapolation-Based Policy Optimization
The article introduces Gradient Extrapolation-Based Policy Optimization (GXPO), a method that approximates multi-step lookahead in RL training for LLMs using only three backward passes. It demonstrates improved reasoning performance on math benchmarks over standard GRPO while maintaining fixed active-phase costs.