A Large Recurrent Action Model: xLSTM enables Fast Inference for Robotics Tasks
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908393865740288 |
|---|---|
| author | Schmied, Thomas Adler, Thomas Patil, Vihang Beck, Maximilian Pöppel, Korbinian Brandstetter, Johannes Klambauer, Günter Pascanu, Razvan Hochreiter, Sepp |
| author_facet | Schmied, Thomas Adler, Thomas Patil, Vihang Beck, Maximilian Pöppel, Korbinian Brandstetter, Johannes Klambauer, Günter Pascanu, Razvan Hochreiter, Sepp |
| contents | In recent years, there has been a trend in the field of Reinforcement Learning (RL) towards large action models trained offline on large-scale datasets via sequence modeling. Existing models are primarily based on the Transformer architecture, which result in powerful agents. However, due to slow inference times, Transformer-based approaches are impractical for real-time applications, such as robotics. Recently, modern recurrent architectures, such as xLSTM and Mamba, have been proposed that exhibit parallelization benefits during training similar to the Transformer architecture while offering fast inference. In this work, we study the aptitude of these modern recurrent architectures for large action models. Consequently, we propose a Large Recurrent Action Model (LRAM) with an xLSTM at its core that comes with linear-time inference complexity and natural sequence length extrapolation abilities. Experiments on 432 tasks from 6 domains show that LRAM compares favorably to Transformers in terms of performance and speed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22391 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Large Recurrent Action Model: xLSTM enables Fast Inference for Robotics Tasks Schmied, Thomas Adler, Thomas Patil, Vihang Beck, Maximilian Pöppel, Korbinian Brandstetter, Johannes Klambauer, Günter Pascanu, Razvan Hochreiter, Sepp Machine Learning Artificial Intelligence In recent years, there has been a trend in the field of Reinforcement Learning (RL) towards large action models trained offline on large-scale datasets via sequence modeling. Existing models are primarily based on the Transformer architecture, which result in powerful agents. However, due to slow inference times, Transformer-based approaches are impractical for real-time applications, such as robotics. Recently, modern recurrent architectures, such as xLSTM and Mamba, have been proposed that exhibit parallelization benefits during training similar to the Transformer architecture while offering fast inference. In this work, we study the aptitude of these modern recurrent architectures for large action models. Consequently, we propose a Large Recurrent Action Model (LRAM) with an xLSTM at its core that comes with linear-time inference complexity and natural sequence length extrapolation abilities. Experiments on 432 tasks from 6 domains show that LRAM compares favorably to Transformers in terms of performance and speed. |
| title | A Large Recurrent Action Model: xLSTM enables Fast Inference for Robotics Tasks |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2410.22391 |