Saved in:
Bibliographic Details
Main Authors: Wang, Hu, Ma, Congbo, Reid, Ian, Yaqub, Mohammad
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.07527
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911613333798912
author Wang, Hu
Ma, Congbo
Reid, Ian
Yaqub, Mohammad
author_facet Wang, Hu
Ma, Congbo
Reid, Ian
Yaqub, Mohammad
contents The advantage function is a central concept in RL that helps reduce variance in policy gradient estimates. For language modeling, Group Relative Policy Optimization (GRPO) was proposed to use the within-group sample mean as a baseline for advantage normalization. This estimator can be sensitive to small group size and rollout-level stochasticity, which may lead to suboptimal advantage estimates in some settings. In this paper, we propose Kalman Filter Enhanced Group Relative Policy Optimization (KRPO), a lightweight variant that treats per-group rewards as noisy observations of a latent prompt-level reward baseline and uses a 1D Kalman filter to estimate both the baseline and its uncertainty. KRPO introduces no additional learned parameters and can be integrated into GRPO with minimal computational overhead. On mathematical reasoning benchmarks, KRPO consistently improves training reward curves and final accuracy over GRPO. These results suggest that adaptive advantage estimation is a promising direction for critic-free reinforcement learning in language model reasoning. The code is available at https://github.com/billhhh/KRPO_LLMs_RL.
format Preprint
id arxiv_https___arxiv_org_abs_2505_07527
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Kalman Filter Enhanced GRPO for Reinforcement Learning-Based Language Model Reasoning
Wang, Hu
Ma, Congbo
Reid, Ian
Yaqub, Mohammad
Machine Learning
The advantage function is a central concept in RL that helps reduce variance in policy gradient estimates. For language modeling, Group Relative Policy Optimization (GRPO) was proposed to use the within-group sample mean as a baseline for advantage normalization. This estimator can be sensitive to small group size and rollout-level stochasticity, which may lead to suboptimal advantage estimates in some settings. In this paper, we propose Kalman Filter Enhanced Group Relative Policy Optimization (KRPO), a lightweight variant that treats per-group rewards as noisy observations of a latent prompt-level reward baseline and uses a 1D Kalman filter to estimate both the baseline and its uncertainty. KRPO introduces no additional learned parameters and can be integrated into GRPO with minimal computational overhead. On mathematical reasoning benchmarks, KRPO consistently improves training reward curves and final accuracy over GRPO. These results suggest that adaptive advantage estimation is a promising direction for critic-free reinforcement learning in language model reasoning. The code is available at https://github.com/billhhh/KRPO_LLMs_RL.
title Kalman Filter Enhanced GRPO for Reinforcement Learning-Based Language Model Reasoning
topic Machine Learning
url https://arxiv.org/abs/2505.07527