arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.04003math.OC
收藏

硬件高效的混合精度CP张量分解

Hardware-Efficient Mixed-Precision CP Tensor Decomposition

Zi Yang, Junnan Shan, Zheng Zhang

摘要:

张量分解在机器学习和大容量数据分析中有着广泛的应用。然而,大规模的张量因式分解往往消耗巨大的内存和计算成本。与此同时,现代化的计算硬件,如张量处理单元(TPU)和张量核心GPU,通过混合或低精度算术表示打开了一个新的硬件高效计算窗口。在本文中,我们利用张量分解的低精度表示,并提出了一种混合精度块随机梯度下降(SGD)方法,以减少CP张量分解的成本。我们的方法通过两阶段优化实现了鲁棒和快速收敛,即,SignSGD后跟混合精度SGD。详细的理论分析证明了所提出的混合精度算法的收敛性。在合成和真实张量数据集上的数值实验表明,与全精度CP分解相比,混合精度算法具有更高的效率。这项工作可以显着降低资源受限的边缘计算设备上的内存,计算和能源成本。我们通过FPGA原型证明了这一优势。

英文摘要:

Tensor decomposition has been widely used in machine learning and high-volume data analysis. However, large-scale tensor factorization often consumes huge memory and computing cost. Meanwhile, modernized computing hardware such as tensor processing units (TPU) and Tensor Core GPU has opened a new window of hardware-efficient computing via mixed- or low-precision arithmetic representations. In this paper, we exploit the low-precision representation of tensor factorization, and propose a mixed-precision block stochastic gradient descent (SGD) method to reduce the costs of CP tensor decomposition. Our method achieves robust and fast convergence via a two-stage optimization, i.e., SignSGD followed by mixed-precision SGD. Detailed theoretical analysis is provided to prove the convergence of the proposed mixed-precision algorithm. Numerical experiments on both synthetic and realistic tensor data sets show the superior efficiency of our mixed-precision algorithm compared to full-precision CP decomposition. This work can remarkably reduce the memory, computing and energy cost on resource-constraint edge computing devices. We demonstrate this benefit via an FPGA prototype.

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

↑