arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.08006math.NAcs.MScs.NA
收藏

当前多核架构上张量列车格式线性求解器的性能

Performance of linear solvers in tensor-train format on current multicore architectures

Melven Röhrig-Zöllner, Manuel Joey Becklas, Jonas Thies, Achim Basermann

AI总结:

本文研究张量列车格式下低秩线性系统求解器在多核 CPU 上的性能,比较 TT-GMRES、MALS 和 AMEn 三种算法,并通过优化正交化、SVD 和张量收缩及提出 TT 秩 1 预条件子,使 AMEn 获得约 5 倍加速。

摘要:

张量网络是一类旨在降低高维问题计算复杂度的算法。它们被用于越来越多的应用中,从量子模拟到机器学习。在这些算法中利用数据并行性是使用现代硬件的关键。然而,将所需的张量运算映射到线性代数例程(“构建块”)上有多种方式。优化这种映射会影响数值行为,因此计算方面和数值方面必须同时考虑。在本文中,我们讨论了张量列车格式(也称为矩阵乘积态)下低秩线性系统求解器的性能。我们考虑了三种流行的算法:TT-GMRES、MALS 和 AMEn。我们以离散一个简单的高维偏微分方程(例如在 $50^{10}$ 个网格点上)为例,说明了它们的计算复杂度。这表明,对于 MALS 和 AMEn,投影到较小的子问题可将浮点运算次数减少数个数量级。我们针对正交化步骤、奇异值分解和张量收缩提出了优化建议。此外,我们基于线性算子的 TT 秩 1 近似,提出了一种通用预条件子。总体而言,在当前多核 CPU 上,最快的方法(AMEn)相对于参考算法获得了大约 5 倍的加速。

英文摘要:

Tensor networks are a class of algorithms aimed at reducing the computational complexity of high-dimensional problems. They are used in an increasing number of applications, from quantum simulations to machine learning. Exploiting data parallelism in these algorithms is key to using modern hardware. However, there are several ways to map required tensor operations onto linear algebra routines ("building blocks"). Optimizing this mapping impacts the numerical behavior, so computational and numerical aspects must be considered hand-in-hand. In this paper we discuss the performance of solvers for low-rank linear systems in the tensor-train format (also known as matrix-product states). We consider three popular algorithms: TT-GMRES, MALS, and AMEn. We illustrate their computational complexity based on the example of discretizing a simple high-dimensional PDE in, e.g., $50^{10}$ grid points. This shows that the projection to smaller sub-problems for MALS and AMEn reduces the number of floating-point operations by orders of magnitude. We suggest optimizations regarding orthogonalization steps, singular value decompositions, and tensor contractions. In addition, we propose a generic preconditioner based on a TT-rank-1 approximation of the linear operator. Overall, we obtain roughly a 5x speedup over the reference algorithm for the fastest method (AMEn) on a current multicore CPU.

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

↑