arXiv Machine Learning

Which Rollout Taught It That? BehaviorTrace and the Limits of Training-Data Attribution in Online RL

The paper introduces BehaviorTrace, an evaluation framework for assessing training‑data attribution in online reinforcement‑learning fine‑tuning of language models. Using a planted behavior on Qwen2.5‑1.5B, the authors show that many attribution signals are confounded by factors such as gradient magnitude and model fluency, and that only the gradient of trigger tokens consistently aligns with the true behavior across seeds. They provide a checklist for evaluating attribution methods and test existing estimators without proposing a new one.

arXiv AI
Jul 15

A Learning-Rate-Gated Failure of GRPO in a Small Language and Vision-Language Model Web Agent: A Controlled Null and Its Mechanism

arXiv:2607. 12640v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards, and Group Relative Policy Optimization (GRPO) in particular, is now run routinely on a supervised checkpoint in the hope of producing a stronger agent.

By Chengguang Gan, Zhixi Cai, Yunhao Liang, Hanjun Wei, Shiwen Ni, Qinghao Zhang
arXiv Machine Learning
Aug 27

Demystifying Reinforcement Learning Post-Training of Language Models

The paper "Demystifying Reinforcement Learning Post-Training of Language Models" investigates how reinforcement learning (RL) post‑training enhances large language models (LLMs) for tasks such as reasoning, math, and coding. By isolating RL components in a controlled setting, the authors analyze how the base model’s prior distribution, reward granularity, prompt diversity, and model scale influence outcomes, using policy entropy to compare pre‑training, supervised fine‑tuning (SFT), and RL stages. The study clarifies the role of spurious rewards, the importance of the base model’s probability mass on desired behaviors, and how these factors interact to determine post‑training success, offering a practical primer for NLP researchers. "whyItMatters":"The work provides a clearer understanding of RL post‑training mechanics, helping researchers and practitioners effectively apply RL to improve LLM capabilities."

By Donovan Clay, Saket Gollapudi, Sankar Harilal, Min Jang, Jacob Morrison, Sewoong Oh, Natasha Jaques
arXiv AI
Jul 7

Weak-to-Strong Generalization via Direct On-Policy Distillation

arXiv:2607. 05394v1 Announce Type: cross Abstract: Reinforcement learning with verifiable rewards (RLVR) is a powerful recipe for improving language-model reasoning, but it is expensive to repeat on every new strong model because the target model must generate many rollouts during training.

By Shiyuan Feng, Huan-ang Gao, Haohan Chi, Hanlin Wu, Zhilong Zhang, Zheng Jiang, Bingxiang He, Wei-Ying Ma, Ya-Qin Zhang, Hao Zhou
arXiv AI
Jun 9

Sparrow: Sparse Rollout for Stable and Efficient Long-context RL of Large Language Models

arXiv:2606. 08446v1 Announce Type: cross Abstract: Despite being powerful, reinforcement learning with verifiable rewards (RLVR) induces extremely long COT, making it computationally expensive.

By Yang Zhou, Ranajoy Sadhukhan, Zhaofeng Sun, Zhuoming Chen, Souvik Kundu, Saket Dingliwal, Sai Muralidhar Jayanthi, Aram Galstyan, Haizhong Zheng, Beidi Chen
arXiv AI
6d ago

Wrong Votes, Right Gradients: Why Majority-Vote Rewards Track Verifiable RL

The paper investigates why reinforcement learning with self‑generated labels—specifically majority‑vote rewards—can recover most of the performance gains of training with verifiable rewards. It argues that the key factor is batch‑level updates: a prompt’s own gradient contributes less than 1% to its output change, so only coherent label errors across prompts influence learning. Experiments on five models show that majority‑vote updates align almost perfectly with gold updates, with misdirection disappearing as batch size grows and incoherent errors behaving like random noise.

By Dylan P. Wilson, Chengsong Huang, Jiaxin Huang