arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.01522eess.SPcs.AR
收藏

FPGA上的Tucker张量分解

Tucker Tensor Decomposition on FPGA

Kaiqi Zhang, Xiyuan Zhang, Zheng Zhang

摘要:

张量计算已经成为解决科学和工程中高维和/或极端规模问题的强大数学工具。过去十年见证了张量计算及其在机器学习和大数据中的应用的巨大进步。然而,它在资源受限设备上的硬件优化仍然是一个(几乎)未开发的领域。本文提出了一个硬件加速器的经典张量计算框架,塔克分解。我们研究了该架构的三个模块:张量时间矩阵(TTM),矩阵奇异值分解(SVD),张量置换,并实现了Xilinx FPGA原型。为了进一步减少计算时间,提出了一种奇异值分解Jacobi迭代的温启动算法。一个定点模拟器是用来评估我们的设计的性能。一些合成数据集和一个真正的MRI数据集被用来验证设计和评估其性能。我们将我们的工作与在CPU和GPU上运行的最先进的软件工具箱进行了比较,我们的工作在心脏MRI数据集上显示了2.16 - 30.2倍的加速。

英文摘要:

Tensor computation has emerged as a powerful mathematical tool for solving high-dimensional and/or extreme-scale problems in science and engineering. The last decade has witnessed tremendous advancement of tensor computation and its applications in machine learning and big data. However, its hardware optimization on resource-constrained devices remains an (almost) unexplored field. This paper presents an hardware accelerator for a classical tensor computation framework, Tucker decomposition. We study three modules of this architecture: tensor-times-matrix (TTM), matrix singular value decomposition (SVD), and tensor permutation, and implemented them on Xilinx FPGA for prototyping. In order to further reduce the computing time, a warm-start algorithm for the Jacobi iterations in SVD is proposed. A fixed-point simulator is used to evaluate the performance of our design. Some synthetic data sets and a real MRI data set are used to validate the design and evaluate its performance. We compare our work with state-of-the-art software toolboxes running on both CPU and GPU, and our work shows 2.16 - 30.2x speedup on the cardiac MRI data set.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑