Orchestrating Tokens and Sequences: Dynamic Hybrid Policy Optimization for RLVR (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing RLVR algorithms focus on different granularities and have complementary strengths and limitations. |
| Approach: | They propose a framework for reinforcement learning with verifiable rewards that bridges RLVR and GSPO . group-level importance ratios are used to update a policy, which preserves fine-grained credit assignment . |
| Outcome: | The proposed framework outperforms existing methods on seven reasoning benchmarks. |
Similar Papers
Token-Level Policy Optimization: Linking Group-Level Rewards to Token-Level Aggregation via sequence-level likelihood (2026.acl-long)
Copied to clipboard
| Challenge: | Group Relative Policy Optimization (GRPO) has significantly advanced the reasoning ability of large language models (LLMs). |
| Approach: | They propose a token-level framework that leverages sequence-level likelihood to link group-level rewards with individual tokens via token- level aggregation and introduces a KL-Divergence mask constraint that targets tokens with positive advantages and decreasing entropy to mitigate abrupt policy updates. |
| Outcome: | Experiments show that TEPO achieves state-of-the-art performance on mathematical reasoning benchmarks and reduces convergence time by 50% compared with GRPO/DAPO. |
Think Outside the Policy: In-Context Steered Policy Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing Reinforcement Learning from Verifiable Rewards (RLVR) methods exhibit limited exploration due to reliance on on-policy rollouts which are limited to the current policy’s distribution, resulting in narrow trajectory diversity. |
| Approach: | They propose a framework that leverages the in-context learning capability of Large Reasoning Models to provide expert guidance using existing datasets. |
| Outcome: | The proposed framework improves RLVR performance and training stability on mathematical reasoning benchmarks. |
MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sample-Efficient LLM Reasoning (2026.acl-long)
Copied to clipboard
Xiaoliang Fu, Jiaye Lin, Yangyi Fang, Binbin Zheng, Chaowen Hu, Zekai Shao, Cong Qin, Lu Pan, Ke Zeng, Xunliang Cai
| Challenge: | Existing RLVR algorithms rely on rigid, uniform, and symmetric trust region mechanisms . current algorithms lack robustness, asymmetric signal reliability and inefficient gradient utilization . |
| Approach: | They propose a framework to harmonize three dimensions of RLVR algorithms, a paper argues . a binary cutoff is used to discard valuable reinforcement signals, they argue . |
| Outcome: | The proposed framework outperforms baselines in evaluating a robust RLVR solution. |
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. |
Improved Policy Optimization for Mixture-of-Experts Models: Importance Sampling and Rewarding from an Expert-Centric Perspective (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to reinforcement learning (RL) suffer from training instability . existing approaches often ignore token-specific discrepancies in expert assignments . |
| Approach: | They propose to introduce expert-level importance sampling to reduce complexity of RL . they propose to leverage expert-centric granularity to ensure a rigorous alignment between reward signals and policy updates. |
| Outcome: | The proposed method outperforms strong baselines across reasoning tasks. |
Taming Extreme Tokens: Covariance-Aware GRPO with Gaussian-Kernel Advantage Reweighting (2026.acl-short)
Copied to clipboard
| Challenge: | Excessive exploitation can cause the model to become overconfident in its suboptimal solutions, thereby limiting its capabilities to explore novel reasoning strategies. |
| Approach: | They propose a method that dynamically down-weights extreme token-level updates via a Gaussian kernel and reduces the instability caused by the trade-off. |
| Outcome: | The proposed method improves downstream performance across reasoning benchmarks and stabilizes entropy as training progresses. |
AG-GRPO: Answer-Guided GRPO for Masked Diffusion Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Recent work on large language models (LLMs) has emphasized not only final-answer accuracy but also reliability of reasoning on challenging tasks. |
| Approach: | They propose an answer-guided group-relative policy optimization for masked diffusion language models which generates text through iterative mangled token restoration. |
| Outcome: | The proposed approach improves over pretrained dLLMs and prior RL methods across mathematics, puzzle-solving, and code-generation benchmarks. |
DRA-GRPO: Your GRPO Needs to Know Diverse Reasoning Paths for Mathematical Reasoning (2026.findings-acl)
Copied to clipboard
Xiwen Chen, Wenhui Zhu, Peijie Qiu, Xuanzhao Dong, Hao Wang, Haiyu Wu, Huayu Li, Aris Sotiras, Yalin Wang, Abolfazl Razi
| Challenge: | Existing methods for group-relative policy optimization rely on scalar correctness rewards that are often non-injective with respect to semantic content. |
| Approach: | They propose a framework that calibrates the reward signal using the semantic density of sampled groups. |
| Outcome: | The proposed framework outperforms strong baselines on five math benchmarks with 7,000 samples and 55 cost. |
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. |
AIPO: Adaptive Information Guided Token-Level Reinforcement Learning for Large Language Model Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing RLVR methods focus on all generated tokens rather than on which tokens contribute to reasoning. |
| Approach: | They propose to use a Random–Fourier approximation of the Hilbert–Schmidt Independence Criterion to focus updates on decisive tokens discovered on the fly to improve the efficiency of mutual-information estimation. |
| Outcome: | The proposed approach yields +20% accuracy over strong RLVR baselines while updating merely 10% of tokens, demonstrating superior efficiency and effectiveness. |