Skip to content
Preprint

psRL: Efficient Training for Agentic AI via Training-Time Prefix Sharing

Aug 2026 · 1 citation · 52 references
Computer Science

TL;DR

This paper proposes psRL (prefix sharing for RL), a new training system for agentic AI designed to exploit prefix redundancy among training samples, and introduces two novel prefix-sharing mechanisms that enable flexible, fine-grained workload distribution across GPU workers.

Abstract

In modern agentic AI training, the system bottleneck is shifting from rollout to update. Emerging sampling strategies such as tree-structured and step-wise RL greatly increase training sample volume while incurring relatively low marginal rollout cost, causing the update phase to dominate the end-to-end execution time. Crucially, this shift exposes a new optimization opportunity, as production traces reveal substantial prefix redundancy across training samples. In this paper, we propose psRL (prefix sharing for RL), a new training system for agentic AI designed to exploit prefix redundancy among training samples. Leveraging the global visibility and data immutability inherent to the update phase, psRL achieves efficient workload scheduling and memory management for distributed training. Specifically, psRL introduces two novel prefix-sharing mechanisms that enable flexible, fine-grained workload distribution across GPU workers, simultaneously optimizing prefix reuse and achieving load balancing. Moreover, psRL implements a new underlying KV cache manager that facilitates adaptable block-size allocation and dynamic KV caching, maximizing memory utilization while maintaining a high prefix hit rate. Evaluations using production traces demonstrate that psRL outperforms existing systems by up to 5.2x in throughput. The source code will be publicly available soon.

View source

Similar papers

Jul 2026

WAR: Workload-Aware Rollouts for Synchronous Agentic Reinforcement Learning

This work proposes WAR, a workload-aware rollout system that substantially accelerates synchronous agentic RL by jointly optimizing decoding and scheduling, and provides a practical path toward scalable long-context agent training.

Ryan Xu, Atlas Zhao, David Bao et al. · 0 citations
#machine learning Preprint Jul 2026

Belayer: Efficient Fault Tolerance for LLM Agentic RL Training

Belayer handles failures in both rollout engines and environment execution while targeting low failure-free overhead, and shows low measured overhead during failure-free training, a worker-recovery-time reduction of up to 42 times faster compared with a full engine cold start, and 1.5 to 3.5 times faster recovery from...

Jiecheng Zhou, Qi Hu, Peng Sun et al. · 0 citations
Preprint Aug 2026

AReaL-DTE: Sparse Policy-Weight Transfer for Online Agentic Reinforcement Learning

AReaL-DTE is presented, a snapshot-free Delta Transfer Engine that translates inference-visible weight sparsity into end-to-end system efficiency and achieves speedups of up to 19.9x over ByteCheckpoint and 3.2x over PULSE across clusters, and up to 7.6x and 7.4x within a cluster.

Yingqi Peng, Jia-Wei Zhang, Wenhao Zhou et al. · 1 citation

W EAVE : Efficient Co-Scheduling for Disaggregated RL Post-Training

W EAVE is a cluster scheduling framework built on the insight that the structural idleness of one job can be effectively utilized by the active phase of another, and introduces the co-execution group abstraction, which partitions the cluster into isolated locality domains.

Tianyuan Wu, Lunxi Cao, Yi-Chen Wei et al. · 3 citations
Preprint Aug 2026

Scheduling Mixed RL Rollouts Beyond Prefix Locality

MISA-T, a routing-layer admission policy for mixed rollout serving that combines adaptive session admission, workload-aware KV-capacity allocation, and residency-time-aware KV accounting, is presented.

Zetao Hong, Song Yuan, Yuan-Hao Ding et al. · 2 citations · ⚡1

TRACE-ROUTER: Task-Consistent and Adaptive Online Routing for Agentic AI

TRACE-Router is presented, a task-level routing framework that aligns routing with the unit of supervision, and learns routing policies that adapt to the workload while avoiding explicit task-complexity estimation.

Ritik Raj, Souvik Kundu, Sarbartha Banerjee et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.