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. |
Similar Papers
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. |
Revisiting Entropy Regularization: Adaptive Coefficient Unlocks Its Potential for LLM Reinforcement Learning (2026.findings-acl)
Copied to clipboard
| 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. |
Breaking Consensus Bias: Unsupervised Reinforcement Learning for Machine Translation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing RL approaches for MT face fixed references or the production of homogeneous references leading to mode collapse in unsupervised settings. |
| Approach: | They propose an Entropy-Driven Unsupervised RL framework for machine translation that leverages entropy for supervision construction and self-evolution. |
| Outcome: | The proposed framework outperforms supervised and unsupervised baselines in multiple language pairs. |
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. |
Entropy Scheduling in Reinforcement Learning for Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | entropy in reinforcement learning functions analogously to the learning rate in LLMs. |
| Approach: | They propose an entropy scheduling system that optimizes different pre-set goals by controlling and scheduling entropicy at each step of the RL process. |
| Outcome: | The proposed method improves AIME2024 from 50.9 to 54.9 within 40 training steps. |
CE-GPPO: Coordinating Entropy via Gradient-Preserving Clipping Policy Optimization in Reinforcement Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for proximal policy optimization discard valuable gradient signals from low-probability tokens due to the clipping mechanism. |
| Approach: | They propose an algorithm that reintroduces gradients from clipped tokens in native PPO in a gentle and bounded manner. |
| Outcome: | The proposed algorithm outperforms strong baselines on reasoning benchmarks on different model scales. |
A Few Bad Apples Spoil the Bunch: Preventing Global Entropy Collapse Driven by a Small Set of Tokens in LLM Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Reinforcement learning with verifiable rewards and Reinforced Learning from internal feedback fail to benefit from test-time compute due to entropy collapse and the resulting loss of reasoning diversity. |
| Approach: | They propose a strategy that assigns each generated token a redistribution score and applies selective KL regularization to only the top 5% of tokens under this score. |
| Outcome: | The proposed model improves on both RLVR and RLIF models on math reasoning benchmarks, showing that targeted entropy control at a vanishingly small subset of tokens is sufficient to sustain reasoning diversity and effective test-time scaling. |
LEPO: Latent Reasoning Policy Optimization for Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing latent reasoning methods that use chain of thought (CoT) are limited to selecting one discrete token at each reasoning step, which potentially induces information loss. |
| Approach: | They propose a framework that injects controllable stochasticity into latent reasoning via Gumbel-Softmax, restoring LLMs' exploratory capacity and enhancing their compatibility with Reinforcement Learning (RL). |
| Outcome: | The proposed framework preserves richer information for more comprehensive reasoning and is compatible with Reinforcement Learning (RL). |
DPEPO: Diverse Parallel Exploration Policy Optimization for LLM-based Agents (2026.acl-long)
Copied to clipboard
JunShuo Zhang, Chengrui Huang, Feng Guo, Zihan Li, Ke Shi, Menghua Jiang, Jiguo Yu, Shuo Shang, Shen Gao
| Challenge: | Existing approaches to large language model (LLM) agents that follow the sequential "reason-then-act" paradigm suffer from limited exploration and incomplete environmental understanding as they interact with only a single environment per step. |
| Approach: | They propose a paradigm that enables an agent to interact with multiple environments simultaneously and share cross-trajectory experiences. |
| Outcome: | The proposed paradigm achieves state-of-the-art (SOTA) success rates while maintaining comparable efficiency to strong sequential baselines. |
Unlocking Exploration in RLVR: Uncertainty-aware Advantage Shaping for Deeper Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Reinforcement Learning with Verifiable Rewards (RLVR) has shown significant promise for enhancing the reasoning capabilities of large language models (LLMs). |
| Approach: | They propose a model-free method that refines credit assignment by leveraging the model's internal uncertainty signals. |
| Outcome: | Extensive experiments on five mathematical reasoning benchmarks show that the proposed method outperforms strong RLVR baselines on multiple model scales, including 1.5B and 7B. |