张量列车数据格式中的克里金法
Kriging in Tensor Train data format
AI总结:
本文提出了一种结合低张量秩技术和基于快速傅里叶变换的方法,用于加速统计运算,如克里金法、计算条件协方差和地质统计最优设计。通过将鲁棒的张量列车(TT)协方差矩阵近似和高效的TT-Cross算法融入基于FFT的克里金法中,将计算复杂度降低到O(d r³ n),并在合成和实际数据中展示了其相对于普通FFT方法的优势。
摘要:
低张量秩技术与基于快速傅里叶变换(FFT)的方法的结合在加速各种统计运算如克里金法、计算条件协方差、地质统计最优设计等方面显得尤为重要。然而,将完整的张量近似为低秩格式可能会带来计算上的挑战。在本工作中,我们结合了鲁棒的张量列车(TT)协方差矩阵近似和高效的TT-Cross算法,将其应用于基于FFT的克里金法中。结果显示,这里克里金法的计算复杂度被降低到O(d r³ n),其中n是估计网格的模式大小,d是变量的数量(维度),r是协方差矩阵的TT近似秩。对于许多流行的协方差函数,TT秩r在n和d增加时保持稳定。在合成和实际数据示例中,展示了这种方法相对于使用普通FFT方法的优势。
英文摘要:
Combination of low-tensor rank techniques and the Fast Fourier transform (FFT) based methods had turned out to be prominent in accelerating various statistical operations such as Kriging, computing conditional covariance, geostatistical optimal design, and others. However, the approximation of a full tensor by its low-rank format can be computationally formidable. In this work, we incorporate the robust Tensor Train (TT) approximation of covariance matrices and the efficient TT-Cross algorithm into the FFT-based Kriging. It is shown that here the computational complexity of Kriging is reduced to $\mathcal{O}(d r^3 n)$, where $n$ is the mode size of the estimation grid, $d$ is the number of variables (the dimension), and $r$ is the rank of the TT approximation of the covariance matrix. For many popular covariance functions the TT rank $r$ remains stable for increasing $n$ and $d$. The advantages of this approach against those using plain FFT are demonstrated in synthetic and real data examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。