Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2309.12252 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911758797504512 |
|---|---|
| author | Lim, Yi Heng Zhu, Qi Selfridge, Joshua Kasim, Muhammad Firmansyah |
| author_facet | Lim, Yi Heng Zhu, Qi Selfridge, Joshua Kasim, Muhammad Firmansyah |
| contents | Sequential models, such as Recurrent Neural Networks and Neural Ordinary Differential Equations, have long suffered from slow training due to their inherent sequential nature. For many years this bottleneck has persisted, as many thought sequential models could not be parallelized. We challenge this long-held belief with our parallel algorithm that accelerates GPU evaluation of sequential models by up to 3 orders of magnitude faster without compromising output accuracy. The algorithm does not need any special structure in the sequential models' architecture, making it applicable to a wide range of architectures. Using our method, training sequential models can be more than 10 times faster than the common sequential method without any meaningful difference in the training results. Leveraging this accelerated training, we discovered the efficacy of the Gated Recurrent Unit in a long time series classification problem with 17k time samples. By overcoming the training bottleneck, our work serves as the first step to unlock the potential of non-linear sequential models for long sequence problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_12252 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Parallelizing non-linear sequential models over the sequence length Lim, Yi Heng Zhu, Qi Selfridge, Joshua Kasim, Muhammad Firmansyah Machine Learning Distributed, Parallel, and Cluster Computing Computational Physics Sequential models, such as Recurrent Neural Networks and Neural Ordinary Differential Equations, have long suffered from slow training due to their inherent sequential nature. For many years this bottleneck has persisted, as many thought sequential models could not be parallelized. We challenge this long-held belief with our parallel algorithm that accelerates GPU evaluation of sequential models by up to 3 orders of magnitude faster without compromising output accuracy. The algorithm does not need any special structure in the sequential models' architecture, making it applicable to a wide range of architectures. Using our method, training sequential models can be more than 10 times faster than the common sequential method without any meaningful difference in the training results. Leveraging this accelerated training, we discovered the efficacy of the Gated Recurrent Unit in a long time series classification problem with 17k time samples. By overcoming the training bottleneck, our work serves as the first step to unlock the potential of non-linear sequential models for long sequence problems. |
| title | Parallelizing non-linear sequential models over the sequence length |
| topic | Machine Learning Distributed, Parallel, and Cluster Computing Computational Physics |
| url | https://arxiv.org/abs/2309.12252 |