分布式内存并行自适应张量列交叉逼近
Distributed memory parallel adaptive tensor-train cross approximation
AI总结:
针对高维张量逼近问题,提出基于分布式内存多维进程网格的子张量并行自适应TT交叉方法,推导迭代公式并验证其高精度、低存储及优良的可扩展性。
摘要:
张量列(TT)格式是一种数据稀疏的张量表示形式,常用于计算科学与数据科学中出现的高维函数逼近问题。针对不同的张量输入与假设条件,学界已提出多种串行与并行TT分解算法。本文提出子张量并行自适应TT交叉方法,将张量划分到配备多维进程网格的分布式内存机器上,利用张量元素迭代构建TT逼近。我们推导了分布式内存环境下用于枢轴选择与TT核构造的两种迭代公式,对算法进行了通信与可扩展性分析,并通过多组测试实验验证其性能,测试对象包括最高6维的Hilbert张量,以及由动理学理论中麦克斯韦分布函数构造的张量。结果表明,TT交叉逼近在大幅降低存储需求的同时仍能保持较高精度。此外,所提并行算法展现出良好乃至最优的强可扩展性与弱可扩展性。
英文摘要:
The tensor-train (TT) format is a data-sparse tensor representation commonly used in high dimensional function approximations arising from computational and data sciences. Various sequential and parallel TT decomposition algorithms have been proposed for different tensor inputs and assumptions. In this paper, we propose subtensor parallel adaptive TT cross, which partitions a tensor onto distributed memory machines with multidimensional process grids, and constructs an TT approximation iteratively with tensor elements. We derive two iterative formulations for pivot selection and TT core construction under the distributed memory setting, conduct communication and scaling analysis of the algorithm, and illustrate its performance with multiple test experiments. These include up to 6D Hilbert tensors and tensors constructed from Maxwellian distribution functions that arise in kinetic theory. Our results demonstrate significant accuracy with greatly reduced storage requirements via the TT cross approximation. Furthermore, we demonstrate good to optimal strong and weak scaling performance for the proposed parallel algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。