arXiv Computation and Language By Zicheng Xu, Ruixuan Zhang, Yu-Neng Chuang, Xiuyi Lou, Hoang Anh Duy Le, Oren Gal, Alexander S. Szalay, Zhaozhuo Xu, Guanchu Wang, Vladimir Braverman

Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning

Read the original on arXiv Computation and Language →

The paper introduces Adaptive Data Scheduling (ADS), a dual-level framework that improves reinforcement learning for large language models by tailoring data sampling to both semantic clusters and the policy’s current capability. ADS first reorganizes training samples into semantic clusters and adjusts the inter-cluster sampling distribution to focus on clusters the policy can currently handle. Then, within each cluster, ADS selects prompts near the policy’s capability boundary to provide informative relative advantages. Experiments on three LLMs and seven reasoning benchmarks show ADS boosts average accuracy by 5.5% over Group Relative Policy Optimization (GRPO) and consistently benefits various RL objective designs.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Machine Learning
Jul 10

HeaPA: Difficulty-Aware Heap Sampling and On-Policy Query Augmentation for LLM Reinforcement Learning

arXiv:2601. 22448v2 Announce Type: replace Abstract: RLVR has become a standard recipe for training LLMs on reasoning tasks with verifiable outcomes, but when rollout generation dominates the cost, efficiency hinges on which prompts are sampled and when.

By Weiqi Wang, Xin Liu, Binxuan Huang, Hejie Cui, Rongzhi Zhang, Changlong Yu, Shuowei Jin, Jingfeng Yang, Qingyu Yin, Zhengyang Wang, Zheng Li, Yifan Gao, Priyanka Nigam, Bing Yin, Lihong Li, Yangqiu Song