arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.02513math.NAcs.NA
收藏

张量环分解的算法与计算

On Algorithms for and Computing with the Tensor Ring Decomposition

Oscar Mickelin, Sertac Karaman

摘要:

诸如规范格式和张量训练格式的张量分解已经被广泛用于降低高维数据的存储成本和操作复杂性,实现了与输入维度的线性缩放而不是指数缩放。在本文中,我们研究了更低的存储成本表示的张量环格式,这是一个扩展的张量训练格式与可变端秩。首先,我们介绍了两个算法,用于转换张量在全格式张量环格式,以低存储成本。其次,我们详细介绍了张量环的舍入操作,并展示了如何在格式中定义常见的线性代数操作以节省存储成本。最后,我们介绍了基于图的张量格式的图结构转换算法,其复杂度比现有文献低几个数量级。所有算法的效率证明了一些数值例子,在某些情况下,我们表现出显着更高的压缩比相比,以前的方法使用张量环格式。

英文摘要:

Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension instead of exponential scaling. In this paper, we investigate even lower storage-cost representations in the tensor ring format, which is an extension of the tensor train format with variable end-ranks. Firstly, we introduce two algorithms for converting a tensor in full format to tensor ring format with low storage cost. Secondly, we detail a rounding operation for tensor rings and show how this requires new definitions of common linear algebra operations in the format to obtain storage-cost savings. Lastly, we introduce algorithms for transforming the graph structure of graph-based tensor formats, with orders of magnitude lower complexity than existing literature. The efficiency of all algorithms is demonstrated on a number of numerical examples, and in certain cases, we demonstrate significantly higher compression ratios when compared to previous approaches to using the tensor ring format.

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

↑