Reinforcement learning

Policy optimisation, reward modelling and RLHF — how models are trained by feedback rather than by labels.

6,679 stories · RSS feed

arXiv Computation and Language
5d ago

MultiAgent-OPD: End-to-End Training of Hierarchical Multi-Agent Systems with On-Policy Distillation

arXiv:2610.23234v1 Announce Type: new Abstract: In a hierarchical multi-agent system, a Leader assigns tasks and subagents carry them out. Jointly training the Leader and the subagents is difficult b...

By Yuhan Sun, Jiaxin Zhao, Yongdong Luo, Yibo Hu, Meiguang Jin, Junfeng Ma, Weixun Wang, Weihang Pan, Zhongan Bi
arXiv Computation and Language
5d ago

Paved with True Intents: Intent-Aware Training Improves LLM Safety Classification Across Training Regimes

arXiv:2606.27210v2 Announce Type: replace Abstract: We argue that safety classifiers should model user intent as an explicit signal between the prompt and the final label. To study this, we introduce...

By Jeremias Ferrao, Niclas M\"uller-Hof, Iustin S\^irbu, Traian Rebedea, Yftah Ziser
arXiv Computation and Language
5d ago

EdgeWise: Bringing Long-Horizon Agents to the Edge via Selective Cloud Delegation

arXiv:2610.17560v2 Announce Type: replace Abstract: Complex and long-horizon agent tasks often rely on frontier models deployed in the cloud to achieve strong performance. However, using these models...

By Zeru Shi, Jindong Jiang, Ryo Hachiuma, Yonggan Fu, Byung-Kwan Lee, Peter Belcak, Saurav Muralidharan, Ayush Agarwal, Ruixiang Tang, Ambrish Dantrey, Pavlo Molchanov, Anjul Patney, Subhashree Radhakrishnan
arXiv AI
5d ago

Where Research Ideation Begins: Forward-Citation Supervision for Actionable Limitation Generation

The paper investigates the initial step of automated research ideation: generating actionable limitations from literature. By creating the ActLim-Bench dataset of 18,279 evidence‑linked supervision triples, the authors develop a three‑stage post‑training pipeline that improves recall over existing methods. Human evaluations show that the generated limitations are preferred 64.9% of the time and enhance downstream ideation systems.

By Liyang Zhao, Yong Cao, Haibin Ling
arXiv Machine Learning
5d ago

JAXtari: High-Throughput and Easy-to-Modify Arcade Learning Environment

JAXtari is an open‑source, high‑performance reimplementation of Atari 2600 environments that enables massive GPU parallelization. It allows PPO agents to complete 100 M environment steps on a single A100‑GPU in under an hour, far faster than the CPU‑based ALE. Additionally, JAXtari provides object‑centric observations and a flexible modification system, facilitating research into causal modeling, neuro‑symbolic methods, and rapid agent adaptation.

By Quentin Delfosse, Raban Emunds, Paul Seitz, Sebastian Wette, Jannis Bl\"uml, Daniel Kirn, Dominik Mandok, Kristian Kersting
arXiv AI
5d ago

Reason-guided Human Reward Modeling for Preference-based Reinforcement Learning

The paper introduces a reason-guided preference-based reinforcement learning framework that learns a human reward model from trajectory-level feedback. It augments traditional preference labels with reason tags that explain why a behavior is preferred, thereby capturing both human choices and their underlying rationale. By combining the learned human reward with the environment reward during policy optimization, the agent can improve task performance while producing more interpretable, human-aligned, and preference-sensitive behavior.

By Anshul Nayak, Shahil Shaik, Jonathan Smereka, Yue Wang
arXiv AI
5d ago

Pluvio: Assembly Clone Search for Out-of-domain Architectures and Libraries through Transfer Learning and Conditional Variational Information Bottleneck

arXiv:2307.10631v2 Announce Type: replace-cross Abstract: The practice of code reuse is crucial in software development for a faster and more efficient development lifecycle. In reality, however, cod...

By Zhiwei Fu, Steven H. H. Ding, Furkan Alaca, Benjamin C. M. Fung, Philippe Charland
arXiv Computation and Language
Oct 16

WEAVE: Weaving Real-World Code Evolution into Dependency-Structured Tasks for Benchmarking and Training Code Agents

WEAVE is a framework that converts verified pull‑request histories into executable, dependency‑structured tasks for code agents. It organizes related PRs into bounded directed acyclic graphs (DAGs) using repository‑calibrated typed change loci, creating unified tasks that reflect real‑world code evolution. The framework also introduces Graph Credit, a deterministic, test‑grounded metric that measures partial progress consistent with dependencies, providing dense, verifiable rewards for reinforcement learning.

By Weihao Li, Zihang Xu, Zhongqiu Wang, Songwei Yu, Wenqiang Zhu, Yuechen Luo, Jingxuan Xu, Yanan Wu, Haoyang Huang, Ken Deng
arXiv AI
Oct 16

EvolvingBrain: An Adaptive Skill System for Multi-modal Agents Self-Evolution in Open Worlds

EvolvingBrain introduces an adaptive skill system that enables multi-modal agents to self‑evolve in open worlds. The system comprises Stratified Skill Self‑Evolution, which extracts procedural and problematic patterns from trajectories to build a multi‑granularity skill architecture, and State‑Aware Adaptive Execution, which uses structured memory to guide skill fusion based on the agent’s current state. Experiments on VAB‑Minecraft and DiscoveryWorld show improved success rates and generalization, with code available for public release.

By Runxuan Liu, Jingqi Shi, Baoxin Wang, Honghong Zhao, Haoyuan Xu, Yueqing Sun, Jiafeng Liang, Tao He, Dayong Wu, Qi Gu, Shijin Wang, Ming Liu, Bing Qin
arXiv AI
Oct 16

CleanRM: Reward Modeling from Noisy Feedback with a Few Clean Feedback for RLHF

CleanRM is a reward‑modeling approach that mitigates the bias caused by noisy preference data in RLHF. It calibrates sample‑wise noise ratios using a small set of clean feedback via optimal transport, aligning the joint distribution of noisy and clean preferences. The method then trains a reward model with a noise‑corrected surrogate loss, proven to be unbiased with respect to the clean risk, and outperforms existing denoising baselines in experiments.

By Licheng Pan, Haocheng Yang, Yuzhou Chen, Yichen Sun, Yuan Lu, Yunfei Teng, Jiajun Fan, Guangyi Liu, Zhixuan Chu, Hao Wang
arXiv AI
Oct 16

The Density of Thought: Predicting and Steering Reasoning in Large Language Models

The paper studies how the distribution of information across chain‑of‑thought steps—measured by LP variance and Caveman compression ratio—relates to answer correctness in large language models. Across six model sizes, two training paradigms, and 60 GSM8K problems, it finds that lower LP variance predicts accuracy in supervised fine‑tuned models but not in reinforcement‑learning distilled ones, that models prefer more complex distributions, and that steering density at inference time harms accuracy while pre‑generation nudging and a new Entropy‑Gated Density Routing method improve it. The work demonstrates that natural density patterns are functionally important for reasoning and offers practical techniques to enhance performance.

By Tanush Kalhan, Anupam Chattopadhyay, Sriram Ranga, Amritendu Mukherjee
arXiv AI
Oct 16

The Self-Improvement Problem

The paper examines the challenge of safely allowing autonomous AI agents to improve themselves. It formalizes the problem by modeling agents as programs and defining improvement via a potentially uncomputable semantic score. The authors prove that in general, no terminating procedure can reliably accept only genuine improvements while never missing any, but they identify a practical bounded regime where exhaustive simulation can achieve these guarantees, noting its limitations.

By Brian B. Moser, Stanislav Frolov, Tobias C. Nauen, Federico Raue, Andreas Dengel
arXiv AI
Oct 16

Progress Reward Model for Reinforcement Learning via Large Language Models

The paper introduces PRM4RL, a framework that combines task planning and dense reward generation using large language models for reinforcement learning. It decomposes complex tasks into manageable subtasks and employs a fine‑grained progress function to monitor execution, which is then used to construct a Progress Reward Model for potential‑based reward shaping. Experiments on robotics control tasks show that PRM4RL outperforms existing LLM‑based planning and reward methods, achieving state‑of‑the‑art performance.

By Xiuhui Zhang, Ning Gao, Xingyu Jiang, Yihui Chen, Yuheng Pan, Mohan Zhang, Yue Deng
arXiv AI
Oct 16

EliteReplay: Preserving Diverse Solutions in RL Post-Training via Quality-Diversity Search

EliteReplay is a post‑training method that combines GRPO with a quality‑diversity archive to preserve diverse solutions in reinforcement learning. By collecting distinct strategies from a frozen base model before training and replaying them during training, the approach improves accuracy while maintaining a broader set of correct solutions. On text‑to‑SQL tasks, EliteReplay outperforms baselines, achieving higher pass@128 scores and up to 77% more distinct correct strategies, and it better handles ambiguous questions by covering multiple interpretations.

By Hanane Nour Moussa, Doeun Lee, Sachin Kumar