























Abstract:The tensor train (TT) model is widely used to approximate high-dimensional tensors, enabling efficient handling of data that may exceed available memory. TT helps address the curse of dimensionality in applications such as system identification and dynamic programming. In some applications, TT is known as a ``matrix product state" (MPS). This paper introduces algorithms that facilitate the summation, Hadamard (elementwise) product, and matrix--vector product of matrices and vectors (tensors) represented in the tensor train (TT) format. The last product is also known under the acronym MPO--MPS. The proposed algorithms achieve an improved tradeoff between computational efficiency and accuracy compared to state-of-the-art methods.
From: Petr Tichavsky [view email]
[v1]
Fri, 12 Jun 2026 16:53:14 UTC (526 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。