Saved in:
| Main Authors: | , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.07887 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929382755401728 |
|---|---|
| author | Waleffe, Roger Byeon, Wonmin Riach, Duncan Norick, Brandon Korthikanti, Vijay Dao, Tri Gu, Albert Hatamizadeh, Ali Singh, Sudhakar Narayanan, Deepak Kulshreshtha, Garvit Singh, Vartika Casper, Jared Kautz, Jan Shoeybi, Mohammad Catanzaro, Bryan |
| author_facet | Waleffe, Roger Byeon, Wonmin Riach, Duncan Norick, Brandon Korthikanti, Vijay Dao, Tri Gu, Albert Hatamizadeh, Ali Singh, Sudhakar Narayanan, Deepak Kulshreshtha, Garvit Singh, Vartika Casper, Jared Kautz, Jan Shoeybi, Mohammad Catanzaro, Bryan |
| contents | Selective state-space models (SSMs) like Mamba overcome some of the shortcomings of Transformers, such as quadratic computational complexity with sequence length and large inference-time memory requirements from the key-value cache. Moreover, recent studies have shown that SSMs can match or exceed the language modeling capabilities of Transformers, making them an attractive alternative. In a controlled setting (e.g., same data), however, studies so far have only presented small scale experiments comparing SSMs to Transformers. To understand the strengths and weaknesses of these architectures at larger scales, we present a direct comparison between 8B-parameter Mamba, Mamba-2, and Transformer models trained on the same datasets of up to 3.5T tokens. We also compare these models to a hybrid architecture consisting of 43% Mamba-2, 7% attention, and 50% MLP layers (Mamba-2-Hybrid). Using a diverse set of tasks, we answer the question of whether Mamba models can match Transformers at larger training budgets. Our results show that while pure SSMs match or exceed Transformers on many tasks, they lag behind Transformers on tasks which require strong copying or in-context learning abilities (e.g., 5-shot MMLU, Phonebook) or long-context reasoning. In contrast, we find that the 8B Mamba-2-Hybrid exceeds the 8B Transformer on all 12 standard tasks we evaluated (+2.65 points on average) and is predicted to be up to 8x faster when generating tokens at inference time. To validate long-context capabilities, we provide additional experiments evaluating variants of the Mamba-2-Hybrid and Transformer extended to support 16K, 32K, and 128K sequences. On an additional 23 long-context tasks, the hybrid model continues to closely match or exceed the Transformer on average. To enable further study, we release the checkpoints as well as the code used to train our models as part of NVIDIA's Megatron-LM project. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_07887 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Empirical Study of Mamba-based Language Models Waleffe, Roger Byeon, Wonmin Riach, Duncan Norick, Brandon Korthikanti, Vijay Dao, Tri Gu, Albert Hatamizadeh, Ali Singh, Sudhakar Narayanan, Deepak Kulshreshtha, Garvit Singh, Vartika Casper, Jared Kautz, Jan Shoeybi, Mohammad Catanzaro, Bryan Machine Learning Computation and Language Selective state-space models (SSMs) like Mamba overcome some of the shortcomings of Transformers, such as quadratic computational complexity with sequence length and large inference-time memory requirements from the key-value cache. Moreover, recent studies have shown that SSMs can match or exceed the language modeling capabilities of Transformers, making them an attractive alternative. In a controlled setting (e.g., same data), however, studies so far have only presented small scale experiments comparing SSMs to Transformers. To understand the strengths and weaknesses of these architectures at larger scales, we present a direct comparison between 8B-parameter Mamba, Mamba-2, and Transformer models trained on the same datasets of up to 3.5T tokens. We also compare these models to a hybrid architecture consisting of 43% Mamba-2, 7% attention, and 50% MLP layers (Mamba-2-Hybrid). Using a diverse set of tasks, we answer the question of whether Mamba models can match Transformers at larger training budgets. Our results show that while pure SSMs match or exceed Transformers on many tasks, they lag behind Transformers on tasks which require strong copying or in-context learning abilities (e.g., 5-shot MMLU, Phonebook) or long-context reasoning. In contrast, we find that the 8B Mamba-2-Hybrid exceeds the 8B Transformer on all 12 standard tasks we evaluated (+2.65 points on average) and is predicted to be up to 8x faster when generating tokens at inference time. To validate long-context capabilities, we provide additional experiments evaluating variants of the Mamba-2-Hybrid and Transformer extended to support 16K, 32K, and 128K sequences. On an additional 23 long-context tasks, the hybrid model continues to closely match or exceed the Transformer on average. To enable further study, we release the checkpoints as well as the code used to train our models as part of NVIDIA's Megatron-LM project. |
| title | An Empirical Study of Mamba-based Language Models |
| topic | Machine Learning Computation and Language |
| url | https://arxiv.org/abs/2406.07887 |