paper-with-me

Papers

Future-KL Regularized GRPO: Process-Level Credit Assignment from $f$-Divergence Regularization

2026-01-15 · Jiarui Yao, Ruida Wang, Hao Bai, Tong Zhang arxiv

Group Relative Policy Optimization (GRPO) is widely used for critic-free Large Language Model (LLM) post-training, but its KL regularization is usually implemented as a local loss-side token penalty. We show that this misses the policy-gradient signal induced by autoregressive KL regularization. Unlike standard KL-regularized Reinforcement Learning (RL) objectives, GRPO's group normalization induces a non-linear prompt-level utility; for binary verifier rewards, this utility is $2\arcsin\sqrt p$. As a result, reward and KL cannot be fused before normalization without changing the implicit objective. We derive the on-policy gradient of GRPO-style objectives with token-wise $f$-divergence regularization. The reward term recovers the standardized GRPO advantage, while the regularizer term includes a causal future-regularization return-to-go omitted by local KL losses. For reverse KL, this yields a simple future KL correction: add a reverse cumulative sum of per-token log ratios after advantage construction. The resulting method, Future-KL Regularized Policy Optimization (FRPO), requires no critic or extra model passes. On mathematical reasoning tasks, FRPO improves pass@16 in our main large-model setting while maintaining higher entropy and lower policy drift than conventional loss-side KL baselines.

📄 PDF Abstract BibTeX arXiv:2601.10201

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement LearningMathematical Reasoning

Similar Papers 제목 키워드 기반

VeriGate: Verifier-Gated Step-Level Supervision for GRPO

2026-05-28 · Aakriti Agrawal, Minghui Liu, Furong Huang arxiv

Group Relative Policy Optimization (GRPO) is an effective recipe for training reasoning models with verifier-based outcome rewards, but its supervision is sparse: when all sampled trajectories for a prompt receive the sa…

VIMPO: Value-Implicit Policy Optimization for LLMs

2026-06-18 · Zhewei Kang, Aosong Feng, Sergey Levine, Dawn Song 외 arxiv

Reinforcement learning with verifiable rewards has become a central tool for improving the reasoning ability of large language models, but current methods face a trade-off between simplicity and credit assignment. Group-…

Reinforcement Learning

When Correct Solutions Repeat: Rarity-Aware Credit Redistribution for GRPO

2026-08-04 · Zhe Cao, Miaowen Wen, Fangjiong Chen arxiv

Reinforcement learning with verifiable rewards (RLVR) com- monly optimizes each correct completion as an independent learning signal. In GRPO, this completion-level uniformity creates structure-level skew: recurring corr…

Reinforcement Learning

Learning from Own Solutions: Self-Conditioned Credit Assignment for Reinforcement Learning with Verifiable Rewards

2026-06-17 · Yingyu Shan, Yuhang Guo, Zihao Cheng, Zeming Liu 외 arxiv

Reinforcement learning with verifiable rewards (RLVR) has driven substantial progress in training LLMs for reasoning tasks, but representative methods such as GRPO assign uniform credit across all tokens, wasting gradien…

Reinforcement LearningKnowledge Distillation

Learning to Credit the Right Steps: Objective-aware Process Optimization for Visual Generation

2026-04-21 · Rui Li, Ke Hao, Yuanzhi Liang, Haibin Huang 외 arxiv

Reinforcement learning, particularly Group Relative Policy Optimization (GRPO), has emerged as an effective framework for post-training visual generative models with human preference signals. However, its effectiveness i…

Reinforcement LearningVideo Generation