Saved in:
Bibliographic Details
Main Authors: Zhang, Shijie, Zhang, Kevin, Gu, Zheyuan, Guo, Xiang, Guo, Rujun, Liu, Shaoyu, Jiang, Guanjun, Wang, Xiaozhao
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2601.03723
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912806665715712
author Zhang, Shijie
Zhang, Kevin
Gu, Zheyuan
Guo, Xiang
Guo, Rujun
Liu, Shaoyu
Jiang, Guanjun
Wang, Xiaozhao
author_facet Zhang, Shijie
Zhang, Kevin
Gu, Zheyuan
Guo, Xiang
Guo, Rujun
Liu, Shaoyu
Jiang, Guanjun
Wang, Xiaozhao
contents Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as an important paradigm for unlocking reasoning capabilities in large language models, exemplified by the success of OpenAI o1 and DeepSeek-R1. Currently, Group Relative Policy Optimization (GRPO) stands as the dominant algorithm in this domain due to its stable training and critic-free efficiency. However, we argue that GRPO suffers from a structural limitation: it imposes a uniform, static trust region constraint across all samples. This design implicitly assumes signal homogeneity, a premise misaligned with the heterogeneous nature of outcome-driven learning, where advantage magnitudes and variances fluctuate significantly. Consequently, static constraints fail to fully exploit high-quality signals while insufficiently suppressing noise, often precipitating rapid entropy collapse. To address this, we propose \textbf{E}lastic \textbf{T}rust \textbf{R}egions (\textbf{ETR}), a dynamic mechanism that aligns optimization constraints with signal quality. ETR constructs a signal-aware landscape through dual-level elasticity: at the micro level, it scales clipping boundaries based on advantage magnitude to accelerate learning from high-confidence paths; at the macro level, it leverages group variance to implicitly allocate larger update budgets to tasks in the optimal learning zone. Extensive experiments on AIME and MATH benchmarks demonstrate that ETR consistently outperforms GRPO, achieving superior accuracy while effectively mitigating policy entropy degradation to ensure sustained exploration.
format Preprint
id arxiv_https___arxiv_org_abs_2601_03723
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle ETR: Outcome-Guided Elastic Trust Regions for Policy Optimization
Zhang, Shijie
Zhang, Kevin
Gu, Zheyuan
Guo, Xiang
Guo, Rujun
Liu, Shaoyu
Jiang, Guanjun
Wang, Xiaozhao
Machine Learning
Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as an important paradigm for unlocking reasoning capabilities in large language models, exemplified by the success of OpenAI o1 and DeepSeek-R1. Currently, Group Relative Policy Optimization (GRPO) stands as the dominant algorithm in this domain due to its stable training and critic-free efficiency. However, we argue that GRPO suffers from a structural limitation: it imposes a uniform, static trust region constraint across all samples. This design implicitly assumes signal homogeneity, a premise misaligned with the heterogeneous nature of outcome-driven learning, where advantage magnitudes and variances fluctuate significantly. Consequently, static constraints fail to fully exploit high-quality signals while insufficiently suppressing noise, often precipitating rapid entropy collapse. To address this, we propose \textbf{E}lastic \textbf{T}rust \textbf{R}egions (\textbf{ETR}), a dynamic mechanism that aligns optimization constraints with signal quality. ETR constructs a signal-aware landscape through dual-level elasticity: at the micro level, it scales clipping boundaries based on advantage magnitude to accelerate learning from high-confidence paths; at the macro level, it leverages group variance to implicitly allocate larger update budgets to tasks in the optimal learning zone. Extensive experiments on AIME and MATH benchmarks demonstrate that ETR consistently outperforms GRPO, achieving superior accuracy while effectively mitigating policy entropy degradation to ensure sustained exploration.
title ETR: Outcome-Guided Elastic Trust Regions for Policy Optimization
topic Machine Learning
url https://arxiv.org/abs/2601.03723