Rethinking Transformers in Solving POMDPs
<|reference_start|>Rethinking Transformers in Solving POMDPs: Sequential decision-making algorithms such as reinforcement learning (RL) in real-world scenarios inevitably face environments with partial observability. This paper scrutinizes the effectiveness of a popular architecture, namely Transformers, in Partially Observable Markov Decision Processes (POMDPs) and reveals its theoretical limitations. We establish that regular languages, which Transformers struggle to model, are reducible to POMDPs. This poses a significant challenge for Transformers in learning POMDP-specific inductive biases, due to their lack of inherent recurrence found in other models like RNNs. This paper casts doubt on the prevalent belief in Transformers as sequence models for RL and proposes to introduce a point-wise recurrent structure. The Deep Linear Recurrent Unit (LRU) emerges as a well-suited alternative for Partially Observable RL, with empirical results highlighting the sub-optimal performance of the Transformer and considerable strength of LRU.<|reference_end|>
@article{lu2024rethinking,
    title={Rethinking Transformers in Solving POMDPs},
    author={Chenhao Lu and Ruizhe Shi and Yuyao Liu and Kaizhe Hu and Simon S. Du
  and Huazhe Xu},
    journal={arXiv preprint arXiv:2405.17358},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.17358},
    primaryClass={cs.LG cs.AI}
}