Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 6104-6115· 0 citations· 5 references
Abstract
Reinforcement learning from human feedback (RLHF) has become the cornerstone of aligning large language models (LLMs) with human intent. Yet a fundamental question remains unaddressed: how should training data be scheduled when both the model's capabilities and the utility of data are constantly evolving? Current pipelines rely on fixed or uniform sampling, treating data value as static, an assumption we demonstrate to be fundamentally flawed. We identify and formalize the Distribution-Value Coevolution principle: the training value of data is not intrinsic, but emerges dynamically from the interaction between data characteristics and the model's evolving capability boundary. What is highly informative at one stage may become redundant, or even detrimental, at another. This insight demands a paradigm shift from static to adaptive curriculum design. We operationalize this principle through a unified framework with three components: (1) distribution-level organization that groups training data into coherent distributions; (2) sliding-window influence estimation that continuously tracks each distribution's evolving training value; and (3) bandit-guided scheduling that adaptively allocates resources with provable exploration-exploitation guarantees. Experiments show that this approach yields measurable improvements, with up to a 57.1% relative (or 8.9% absolute) improvement on AIME24 for Llama3.2-3B, and gains also observed for models ranging from 1B to 7B parameters.
DataFlex-RL, an evaluation platform for comparing choices under a common GRPO recipe, is introduced, finding that changing the data policy measurably changes the training process but does not produce a reproducible improvement over uniform training.
Hao Liang, Ming-Rui Chen, Hengyi Feng et al.· 2 citations
DIEM is proposed, a principled and fully automated framework that makes data utilization adaptive throughout RFT and consistently outperforms strong static and dynamic baselines.
Haoru Tan, Sitong Wu, Yan-Feng Chen et al.· 0 citations
Modern systems are increasingly expected to transfer across tasks not specified during training. What data facilitates generalization in these new, unanticipated settings? One hypothesis is that data with more structural information could contain shared circuits and subprograms that could be recycled in a wider array o...
Ellen Su, Andres Potapczynski, Shikai Qiu et al.· 0 citations
This work proposes a self-evolving method that reduces failure rates by 51--67% relative to trained baselines and by 8-25% relative to state-of-the-art vision-language-action models after replacing redundant nominal scenarios with diverse failure-prone ones.
Linxuan He, Yuying Tian, Ling-Xiang Fan et al.· arXiv.org· 0 citations
Reinforcement learning with verifiable rewards (RLVR) is rapidly advancing the reasoning capabilities of language models, yet the optimization layer that converts reward feedback into weight-space updates remains poorly understood. Building on our prior analysis (Zhu et al., 2025), we study this missing layer through t...
DE-Venus is presented, a unified framework for data-efficient RLVR that treats supervision as evolving state across data preparation and policy optimization and reduces annotation and training costs without sacrificing scalable RL execution.
Shen-Zhi Yang, Guang-Cheng Zhu, Kai Tang 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.