Challenge: Reasoning ability is a defining capability of Large Language Models (LLMs), but RLVR training suffers from policy entropy collapse, hindering exploration and limiting reasoning performance.
Approach: They propose a framework that dynamically balances exploration and exploitation via three components: difficulty-aware coefficient allocation, initial-anchored target entropy, and dynamic global coefficient adjustment.
Outcome: The proposed framework outperforms baselines on multiple mathematical reasoning benchmarks.

Similar Papers

Rethinking Entropy Interventions in RLVR: An Entropy Change Perspective (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have remarkable reasoning capabilities in complex tasks such as mathematics and coding.
Approach: They propose an entropy-modulation method that adaptively reweighs tokens based on theoretically-estimated entropic variations.
Outcome: The proposed method outperforms state-of-the-art methods in six mathematical reasoning and three coding benchmarks.
Revisiting Entropy in Reinforcement Learning for Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning with verifiable rewards (RLVR) has emerged as a paradigm for enhancing the reasoning capabilities of large language models.
Approach: They propose a positive-advantage reweighting approach that regulates model entropy by adjusting the loss weights assigned to tokens with positive advantages during RLVR training.
Outcome: The proposed approach regulates model entropy by adjusting loss weights assigned to tokens with positive advantages during RLVR training while maintaining competitive performance.
Entropy-Aware Reshaping of Reinforcement Signals for Multi-Answer Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning with verifiable rewards (RLVR) is a standard post-training paradigm for large language models.
Approach: They propose a framework that reshapes how learning signals are normalized and aggregated.
Outcome: Experiments on MCTACO and MMLU-Multi show that the proposed framework improves accuracy, training stability and cross-dataset transfer performance.
Beyond High-Entropy Exploration: Correctness-Aware Low-Entropy Segment-Based Advantage Shaping for Reasoning LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Recent work studies RLVR through token entropy, arguing that high-entropies drive exploration and should receive stronger updates.
Approach: They propose a correctness-aware reinforcement framework that performs fine-grained advantage modulation over low-entropy segments.
Outcome: The proposed framework improves accuracy over strong RL baselines across three backbones and six math benchmarks while maintaining high-entropy exploration.
Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches allocate an equal number of rollouts to all questions during the RL process, which is inefficient.
Approach: They propose a mechanism for dynamically allocating rollout budgets based on the difficulty of the problems, enabling more efficient RL training.
Outcome: The proposed model improves response precision while preserving exploratory ability to uncover potential correct pathways.
Understanding and Preventing Entropy Collapse in RLVR with On-Policy Entropy Flow Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Existing RLVR algorithms suffer from entropy collapse, leading to premature determinism and unstable optimization.
Approach: They propose an adaptive entropy flow balancing mechanism that rescales entropic-increasing and enotro-decreazing updates according to their contributions to enthroy change.
Outcome: The proposed method outperforms existing RLVR algorithms on six reasoning benchmarks.
Targeted Exploration via Unified Entropy Control for Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for group relative policy optimization suffer from entropy collapse . Existing exploration methods introduce additional bias or variance during exploration, making it difficult to maintain stability.
Approach: They propose a framework that provides targeted mechanisms for exploration and stabilization.
Outcome: The proposed framework expands search space on difficult prompts while preventing entropy growth uncontrollably.
Low-probability Tokens Sustain Exploration in Reinforcement Learning with Verifiable Reward (2026.findings-acl)

Copied to clipboard

Challenge: Recent studies show that RLVR training is slow and results plateau as policy entropy collapses . low-probability regularization (Lp-Reg) reduces the number of low-quality exploratory tokens induced by RL training .
Approach: They propose a method to reduce RLVR over-penalization by eliminating low-probability exploratory tokens . they propose 'Low-provability Regularization' to reduce the gradual elimination of low-quality exploratory entropy tokens.
Outcome: The proposed method eliminates low-probability exploratory tokens and prevents suppression of potentially valuable low-property candidates.
Semantic-Space Exploration and Exploitation in RLVR for LLM Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in Reinforcement Learning with Verifiable Rewards (RLVR) have substantially improved the reasoning abilities of Large Language Models (LLMs).
Approach: They propose a method that balances exploration and exploitation in the hidden-state space of response trajectories.
Outcome: The proposed model yields consistent improvements across models, algorithms and reasoning benchmarks.
Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for reinforcement learning with verifiable rewards (RLVR) rely on static objective functions and rigid clipping strategies that misalign with the model’s evolving reasoning capabilities.
Approach: They propose to incorporate Power-Mean Policy Optimization (PMPO) and Feedback-Adaptive Clipping (FAC) to overcome limitations of static mechanisms.
Outcome: Extensive experiments on nine reasoning tasks show the proposed paradigm outperforms state-of-the-art methods.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations