Sparse MTTKRP Acceleration for Tensor Decomposition on GPU
arXiv:2405.08470 · doi:10.1145/3649153.3649187
Abstract
Sparse Matricized Tensor Times Khatri-Rao Product (spMTTKRP) is the bottleneck kernel of sparse tensor decomposition. In this work, we propose a GPU-based algorithm design to address the key challenges in accelerating spMTTKRP computation, including (1) eliminating global atomic operations across GPU thread blocks, (2) avoiding the intermediate values being communicated between GPU thread blocks and GPU global memory, and (3) ensuring a balanced distribution of workloads across GPU thread blocks. Our approach also supports dynamic tensor remapping, enabling the above optimizations in all the modes of the input tensor. Our approach achieves a geometric mean speedup of 1.5x, 2.0x, and 21.7x in total execution time across widely used datasets compared with the state-of-the-art GPU implementations. Our work is the only GPU implementation that can support tensors with modes greater than 4 since the state-of-the-art works have implementation constraints for tensors with a large number of modes.
arXiv commentIn 21st ACM International Conference on Computing Frontiers (CF '24), May 7-9, 2024, Ischia, Italy
References in corpus (5)
- Tensor Decomposition for Signal Processing and Machine Learning
- Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering
- Overview of Constrained PARAFAC Models
- A Unified Optimization Approach for Sparse Tensor Operations on GPUs
- Software for Sparse Tensor Decomposition on Emerging Computing Architectures