arXiv AI By Oussama Hidaoui, Omer Ebead, Ulrich Armel Mbou Sob, Siddarth Singh, Juan Claude Formanek, Felix Chalumeau, Omayma Mahjoub, Sasha Abramowitz, Ruan John de Kock, Wiem Khlifi, Louay Ben Nessir, Simon Verster Du Toit, Daniel Rajaonarivonivelomanantsoa, Asim Awad Osman, Arnol Manuel Fokam, Refiloe Shabe, Arnu Pretorius

Out-of-Distribution Generalisation with Sequence Models in Offline Multi-Agent Reinforcement Learning

Read the original on arXiv AI →

The paper investigates zero‑shot task generalisation in offline multi‑agent reinforcement learning by extending sequence‑modeling architectures to support multi‑task observation and action spaces and variable agent counts. It finds that increasing task diversity, rather than merely enlarging the dataset, is the key driver for robust zero‑shot transfer. Experiments on four challenging environments show a 3.2× mean improvement on held‑out tasks compared to single‑task models and outperform strong behaviour‑cloning baselines.

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 AI.

arXiv Machine Learning
Oct 22

Harness Scaling for Generalizable Agentic Reinforcement Learning

Harness Scaling introduces a new scaling dimension for agentic reinforcement learning by training models across diverse harness configurations instead of a single fixed harness. The approach constructs a factorized harness space, selects a compact training subset with balanced factorial coverage, and organizes cross-harness training to combine global coverage with controlled variation for the same task. Experiments across multiple benchmarks, model scales, and RL algorithms show that Harness Scaling consistently improves generalization to unseen white-box configurations and enables effective transfer to unseen external black-box harnesses.

By Fei Bai, Huatong Song, Chuan Hao, Ran Tao, Jian Yang, Bryan Dai, Wayne Xin Zhao, Ji-Rong Wen
arXiv Machine Learning
4d ago

Events as Triggers for Behavioral Diversity in Multi-Agent Reinforcement Learning

The paper introduces a new multi‑agent reinforcement learning framework that separates agent identity from behavior by using events to trigger behavioral changes. It proposes Neural Manifold Diversity (NMD) to create a continuous behavior manifold and an event‑based hypernetwork that generates Low‑Rank Adaptation (LoRA) modules for on‑the‑fly policy reconfiguration. The authors prove that this design preserves reward maximization and show empirically that it outperforms baselines, generalizes zero‑shot, and uniquely solves tasks requiring sequential behavior reassignment.

By Hannes B\"uchi, Manon Flageat, Eduardo Sebasti\'an, Amanda Prorok
arXiv Machine Learning
Aug 28

Learning Generalizable Behaviors for Terminal Agents

The paper introduces the Agentic Compositional Generalization hypothesis, suggesting that reinforcement learning (RL) primarily refines high‑level decision‑making behaviors that orchestrate pre‑trained low‑level skills, rather than teaching new domain‑specific skills from scratch. It proposes River, a training recipe that enhances reward quality by filtering low‑quality synthetic environments and adding process‑level behavior regularization. Using River, RL‑trained agents outperform other open‑source 8B models on four terminal‑agent benchmarks, achieving significant gains with fewer than 30% of the training environments.

By Yihang Yao, Bo Pang, Xuan Phi Nguyen, Ding Zhao, Shafiq Joty, Semih Yavuz