LGSep 30, 2025

Accelerating Transformers in Online RL

arXiv:2509.26137v1h-index: 8ECAI
Originality Incremental advance
AI Analysis

This work addresses a practical challenge for researchers and practitioners implementing transformers in online RL, offering an incremental improvement to stabilize and accelerate training.

The paper tackles the instability of transformer-based models in model-free online reinforcement learning by introducing a two-stage algorithm that uses a simpler Accelerator policy to pretrain the transformer via behavior cloning before online deployment. The method reduces training time on image-based environments by up to a factor of two and cuts replay buffer size to 10-20 thousand, lowering computational demands.

The appearance of transformer-based models in Reinforcement Learning (RL) has expanded the horizons of possibilities in robotics tasks, but it has simultaneously brought a wide range of challenges during its implementation, especially in model-free online RL. Some of the existing learning algorithms cannot be easily implemented with transformer-based models due to the instability of the latter. In this paper, we propose a method that uses the Accelerator policy as a transformer's trainer. The Accelerator, a simpler and more stable model, interacts with the environment independently while simultaneously training the transformer through behavior cloning during the first stage of the proposed algorithm. In the second stage, the pretrained transformer starts to interact with the environment in a fully online setting. As a result, this model-free algorithm accelerates the transformer in terms of its performance and helps it to train online in a more stable and faster way. By conducting experiments on both state-based and image-based ManiSkill environments, as well as on MuJoCo tasks in MDP and POMDP settings, we show that applying our algorithm not only enables stable training of transformers but also reduces training time on image-based environments by up to a factor of two. Moreover, it decreases the required replay buffer size in off-policy methods to 10-20 thousand, which significantly lowers the overall computational demands.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes