Understanding and Preventing Entropy Collapse in RLVR with On-Policy Entropy Flow Optimization

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Xu, Huimin, Zhao, Shuai, Wu, Xiaobao, Luu, Anh Tuan
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914556955066368
author Xu, Huimin
Zhao, Shuai
Wu, Xiaobao
Luu, Anh Tuan
author_facet Xu, Huimin
Zhao, Shuai
Wu, Xiaobao
Luu, Anh Tuan
contents Reinforcement learning with verifiable rewards (RLVR) has become an effective paradigm for improving the reasoning ability of large language models. However, widely used RLVR algorithms, such as GRPO, often suffer from entropy collapse, leading to premature determinism and unstable optimization. Existing remedies, including entropy regularization and ratio-based clipping heuristics, either control entropy in a coarse-grained manner or rely on approximate on-policy training. In this paper, we revisit entropy collapse from a token-level entropy flow perspective. Our analysis reveals that entropy-decreasing tokens consistently outweigh entropy-increasing ones, resulting in a severely imbalanced entropy flow. This perspective provides a unified explanation of entropy collapse in existing RLVR algorithms and highlights the importance of balancing entropy dynamics. Motivated by this analysis, we propose On-Policy Entropy Flow Optimization (OPEFO), an adaptive entropy flow balancing mechanism that rescales entropy-increasing and entropy-decreasing updates according to their contributions to entropy change, while remaining strict on-policy. Experiments on six mathematical reasoning benchmarks demonstrate that OPEFO improves training stability and final performance. We will release the code and models upon publication.
format Preprint
id arxiv_https___arxiv_org_abs_2605_11491
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Understanding and Preventing Entropy Collapse in RLVR with On-Policy Entropy Flow Optimization
Xu, Huimin
Zhao, Shuai
Wu, Xiaobao
Luu, Anh Tuan
Machine Learning
Artificial Intelligence
Reinforcement learning with verifiable rewards (RLVR) has become an effective paradigm for improving the reasoning ability of large language models. However, widely used RLVR algorithms, such as GRPO, often suffer from entropy collapse, leading to premature determinism and unstable optimization. Existing remedies, including entropy regularization and ratio-based clipping heuristics, either control entropy in a coarse-grained manner or rely on approximate on-policy training. In this paper, we revisit entropy collapse from a token-level entropy flow perspective. Our analysis reveals that entropy-decreasing tokens consistently outweigh entropy-increasing ones, resulting in a severely imbalanced entropy flow. This perspective provides a unified explanation of entropy collapse in existing RLVR algorithms and highlights the importance of balancing entropy dynamics. Motivated by this analysis, we propose On-Policy Entropy Flow Optimization (OPEFO), an adaptive entropy flow balancing mechanism that rescales entropy-increasing and entropy-decreasing updates according to their contributions to entropy change, while remaining strict on-policy. Experiments on six mathematical reasoning benchmarks demonstrate that OPEFO improves training stability and final performance. We will release the code and models upon publication.
title Understanding and Preventing Entropy Collapse in RLVR with On-Policy Entropy Flow Optimization
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2605.11491