Sparse Tucker Tensor Decomposition on a Hybrid FPGA-CPU Platform

Abstract

Recommendation systems, social network analysis, medical imaging, and data mining often involve processing sparse high-dimensional data. Such high-dimensional data are naturally represented as tensors, and they cannot be efficiently processed by conventional matrix or vector computations. Sparse Tucker decomposition is an important algorithm for compressing and analyzing these sparse high-dimensional data sets. When energy efficiency and data privacy are major concerns, hardware accelerators on resource-constraint platforms become crucial for the deployment of tensor algorithms. In this work, we propose a hybrid computing framework containing CPU and FPGA to accelerate sparse Tucker factorization. This algorithm has three main modules: tensor-times-matrix (TTM), Kronecker products, and QR decomposition with column pivoting (QRP). In addition, we accelerate the former two modules on a Xilinx FPGA and the latter one on a CPU. Our hybrid platform achieves $23.6\times \sim 1091\times$ speedup and over $93.519\%\sim 99.514\%$ energy savings compared with CPU on the synthetic and real-world datasets.

arXiv comment10 pages, 7 figures, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

References in corpus (6)

• Tensorizing Neural Networks
• Enabling High-Dimensional Hierarchical Uncertainty Quantification by ANOVA and Tensor-Train Decomposition
• Tensor-Train Recurrent Neural Networks for Video Classification
• Tensor Computation: A New Framework for High-Dimensional Problems in EDA
• A Framework for Practical Parallel Fast Matrix Multiplication
• Bayesian Tensorized Neural Networks with Automatic Rank Selection