以流体动力学为测试平台的张量网络压缩:一维分析基础
Tensor network compression using fluid dynamics as a testbed: Analytical foundations in one dimension
AI总结:
提出基于矩阵乘积态的张量网络方法,用于一维流体动力学数据压缩,实现无损压缩与有损压缩,并通过Burger方程时间演化验证,同时展示压缩域内周期卷积的加速计算能力。
摘要:
高性能计算机产生极端规模的数据集,若要充分利用其潜力,需要对这些数据集进行采样或压缩。现有的数据压缩技术通常利用数据的稀疏性、同质性或对哪些数据子集最感兴趣的{\it 先验}知识等特征。流体动力学数据通常不具备这些特征,因此成为通用压缩技术的理想测试平台,这些技术应客观、稳健,并能根据压缩导致的信息损失进行调整。本文提出一种基于张量网络的方法,具体为矩阵乘积态或张量列,满足这些要求。该方法在一维压缩中进行了演示,并可扩展到更高维度。对于足够高的张量网络键维,随机傅里叶级数实现了无损压缩,存储张量网络所需的内存与键维直接成正比。在较低键维下表现出的有损压缩可以很好地控制在许多流体模拟的相对误差范围内。该压缩算法在Burger方程的时间演化中进行了测试,结果优异。此外,我们展示了通过张量网络周期卷积在压缩形式下执行计算的能力,其速度可比使用快速傅里叶变换和卷积定理快几个数量级。除了作为处理现有计算机生成数据集的吸引人方法外,所使用的张量网络方法可直接转化为新兴的量子计算范式。
英文摘要:
High performance computers produce extreme-scale data sets that require sampling or compression if they are to be used to their full potential. Existing data compression techniques typically exploit features such as sparsity in the data, homogeneity in the data, or {\it a priori} knowledge of what subsets of data are of most interest. Fluid dynamics data in general do not exhibit these features and so are attractive test beds for generic compression techniques that are objective, robust, and tuneable with respect to information lost due to compression. Presented here is a method based on tensor networks, specifically matrix product states or tensor trains, that meets these requirements. The method is demonstrated for compression in one-dimension and is extensible to higher dimensionality. Lossless compression is demonstrated for random Fourier series for sufficiently high bond dimension of the tensor network, with the memory required to store the tensor network scaling directly proportional to the bond dimension. The lossy compression exhibited at lower bond dimension can be well within the relative error of many fluid simulations. The compression algorithm is tested for the time evolution of Burger's equation with excellent results. We additionally demonstrate the capability to perform computations in the compressed form through a tensor network periodic convolution that can be orders of magnitude faster than using fast Fourier transforms and the convolution theorem. In addition to being an attractive method for working with data sets generated by existing computers, the tensor network methods utilised are directly translatable to the emerging paradigm of quantum computing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。