Skip to content

QLPO: Quadrant-weighted Sampling for Length-aware Policy Optimization

Jul 2026 · arXiv.org · Vol abs/2607.21793 · 0 citations · 52 references
Computer Science

TL;DR

Quadrant-weighted Sampling for Length-aware Policy Optimization (QLPO), a simple resampling-based variant of GRPO that introduces implicit length control without modifying the reward function, suggests that structured resampling provides an effective and robust approach to efficient reasoning.

Abstract

Recent large reasoning models often develop long chain-of-thought responses during reinforcement learning (RL), resulting in high inference latency and deployment cost. Existing methods for response length control typically rely on explicit length penalties or additional control modules, which require careful tuning and may compromise reasoning quality. We propose Quadrant-weighted Sampling for Length-aware Policy Optimization (QLPO), a simple resampling-based variant of GRPO that introduces implicit length control without modifying the reward function. QLPO first over-generates candidate responses and then resamples the training group by preserving the empirical correct/incorrect ratio while favoring short correct responses and long incorrect responses. This reshapes the training distribution and implicitly encourages shorter model outputs. Across models ranging from 1.5B to 32B parameters, including both base models and strong reasoning models, QLPO consistently improves the accuracy-length trade-off. It reduces response length by 30% to 70% while preserving reasoning performance. These results suggest that structured resampling provides an effective and robust approach to efficient reasoning.

View source

Similar papers

Preprint Aug 2026

Le Critique: Privileged Value Functions for LLM Reinforcement Learning

This work proposes two complementary strategies to improve the performance of value function RL: Privileged Value Functions (PVF) which provide an elegant mechanism to inject additional task-relevant token-level signal without biasing the policy objective; and TETHER, a baseline that adaptively interpolates between gro...

S. Venkatraman, Matthieu Dinot, Laurence Aitchison · 1 citation · ⚡1
#machine learning Preprint Sep 2026

RL Starts before RL: On Policy Distillation for Better Reinforcement Learning

The results support OPD as preparation for RL and favor forward KL when OPD is followed by RL in the authors' comparison, which highlights the importance of both objective choice and the states receiving supervision for subsequent RL.

Shuai Dong, Yong-Fu Zhu, Yu-Qi Xu et al. · 3 citations · ⚡1
Preprint Aug 2026

SP3O: Reinforcement Learning from Segment Preferences without Reward Modeling

This paper introduces a novel reward-model-free, critic-free, and gradient-based PbRL algorithm compatible with segment preferences named Segment Pairwise Proximal Policy Optimization (SP3O), and provides a theoretical basis for the algorithm and analyze the tradeoff in choosing the segment length.

Evan Assmus, Qi-Ning Zhang, Lei Ying · 0 citations
#machine learning Preprint Aug 2026

Group Adaptive Clipping Policy Optimization

Group Adaptive Clipping Policy Optimization (GAPO), a plug-in modification to GRPO methods that adapts the clipping boundary to the rollout advantage, is proposed, motivated by a reverse-KL trust-region perspective, which suggests that rollouts with larger learning signal should receive proportionally greater update he...

Sheng Jia, Xiao Wang, S. Kasiviswanathan et al. · 0 citations
#machine learning Preprint Jul 2026

Verifier-Induced Support Reshaping in On-Policy Optimization

It is shown that on-policy reinforcement learning with verifiable rewards (RLVR) can improve the current objective while making successful behaviors for later objectives too rare to sample and reinforce, and effective rewardable support is defined as successful trajectories reachable within a fixed rollout budget.

Shaohang Wei, Z.Y. Su, Feifan Song et al. · 0 citations
#natural language process... Preprint Sep 2026

ConsensusBench: Benchmark of Consensus Nodes for LLM Reasoning via Outcome Reward Densifying

This work develops a new reinforcement learning signal named ConsensusPR, which directly reduces the reward sparsity of outcome reward across long reasoning trajectories, and introduces ConsensusBench, a novel dataset designed to provide rule-based process-level signals.

Shi-Qi Yan, Chao-Hong Tan, Qian Chen et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.