When should we prefer Decision Transformers for Offline Reinforcement Learning?
Prajjwal Bhargava, Rohan Chitnis, Alborz Geramifard, Shagun Sodhani,, Amy Zhang

TL;DR
This paper empirically compares Decision Transformers with CQL and BC in offline RL, revealing their strengths and weaknesses across various data qualities, task complexities, and stochastic environments, with insights on scaling and architecture.
Contribution
It provides a comprehensive empirical analysis of when to prefer Decision Transformers over other offline RL algorithms, including design and scaling recommendations.
Findings
DT requires more data than CQL but is more robust.
DT outperforms in sparse-reward and low-quality data scenarios.
Scaling data for DT improves Atari scores significantly.
Abstract
Offline reinforcement learning (RL) allows agents to learn effective, return-maximizing policies from a static dataset. Three popular algorithms for offline RL are Conservative Q-Learning (CQL), Behavior Cloning (BC), and Decision Transformer (DT), from the class of Q-Learning, Imitation Learning, and Sequence Modeling respectively. A key open question is: which algorithm is preferred under what conditions? We study this question empirically by exploring the performance of these algorithms across the commonly used D4RL and Robomimic benchmarks. We design targeted experiments to understand their behavior concerning data suboptimality, task complexity, and stochasticity. Our key findings are: (1) DT requires more data than CQL to learn competitive policies but is more robust; (2) DT is a substantially better choice than both CQL and BC in sparse-reward and low-quality data settings; (3)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsEvolutionary Algorithms and Applications
MethodsAbsolute Position Encodings · Q-Learning · Softmax · Layer Normalization · Byte Pair Encoding · Dropout · Attention Is All You Need · Linear Layer · Label Smoothing · Multi-Head Attention
