Salvato in:
Dettagli Bibliografici
Autori principali: Liu, Wenpu, Xu, Yuqi, Xie, Weichu, Zhu, Yongfu, Dong, Shuai, Wang, Ziyue, Shao, Wenqi, Zhang, Xiaoying, Yang, Tong, Duan, Nan, Wang, Jiaqi
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:https://arxiv.org/abs/2605.17333
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913136677748736
author Liu, Wenpu
Xu, Yuqi
Xie, Weichu
Zhu, Yongfu
Dong, Shuai
Wang, Ziyue
Shao, Wenqi
Zhang, Xiaoying
Yang, Tong
Duan, Nan
Wang, Jiaqi
author_facet Liu, Wenpu
Xu, Yuqi
Xie, Weichu
Zhu, Yongfu
Dong, Shuai
Wang, Ziyue
Shao, Wenqi
Zhang, Xiaoying
Yang, Tong
Duan, Nan
Wang, Jiaqi
contents Reinforcement Learning from Verifiable Rewards (RLVR) typically samples multiple responses per prompt and assigns binary rewards based on individual correctness, yet the collective structure of the group output, specifically the distribution of errors, is largely discarded. We identify this as a missed opportunity: empirical analysis reveals that error diversity within a group is a strong predictor of training success, with problems eliciting diverse wrong answers benefiting substantially more from RLVR than those producing homogeneous failures. Motivated by this observation, we propose Error Diversity Advantage Shaping (EDAS), a lightweight, algorithm-agnostic technique that modulates the advantage signal for incorrect rollouts based on intra-group error diversity. EDAS amplifies penalties for dominant, repeated errors and attenuates penalties for rare, exploratory ones, thereby encouraging the model to maintain diverse reasoning paths and discouraging error perseveration. Crucially, EDAS operates as a simple post-hoc adjustment that can be seamlessly integrated into any RLVR algorithm. We validate EDAS on top of several mainstream RLVR methods across a series of models and seven challenging math benchmarks, demonstrating consistent improvements. Notably, EDAS yields an average improvement of 6.29 points over DAPO on Qwen3-8B across seven benchmarks, confirming that exploiting the latent information in group rollouts is a broadly effective strategy for strengthening RLVR.
format Preprint
id arxiv_https___arxiv_org_abs_2605_17333
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Leveraging Error Diversity in Group Rollouts for Reinforcement Learning
Liu, Wenpu
Xu, Yuqi
Xie, Weichu
Zhu, Yongfu
Dong, Shuai
Wang, Ziyue
Shao, Wenqi
Zhang, Xiaoying
Yang, Tong
Duan, Nan
Wang, Jiaqi
Machine Learning
Reinforcement Learning from Verifiable Rewards (RLVR) typically samples multiple responses per prompt and assigns binary rewards based on individual correctness, yet the collective structure of the group output, specifically the distribution of errors, is largely discarded. We identify this as a missed opportunity: empirical analysis reveals that error diversity within a group is a strong predictor of training success, with problems eliciting diverse wrong answers benefiting substantially more from RLVR than those producing homogeneous failures. Motivated by this observation, we propose Error Diversity Advantage Shaping (EDAS), a lightweight, algorithm-agnostic technique that modulates the advantage signal for incorrect rollouts based on intra-group error diversity. EDAS amplifies penalties for dominant, repeated errors and attenuates penalties for rare, exploratory ones, thereby encouraging the model to maintain diverse reasoning paths and discouraging error perseveration. Crucially, EDAS operates as a simple post-hoc adjustment that can be seamlessly integrated into any RLVR algorithm. We validate EDAS on top of several mainstream RLVR methods across a series of models and seven challenging math benchmarks, demonstrating consistent improvements. Notably, EDAS yields an average improvement of 6.29 points over DAPO on Qwen3-8B across seven benchmarks, confirming that exploiting the latent information in group rollouts is a broadly effective strategy for strengthening RLVR.
title Leveraging Error Diversity in Group Rollouts for Reinforcement Learning
topic Machine Learning
url https://arxiv.org/abs/2605.17333