Parallel algorithms for computing the tensor-train decomposition
arXiv:2111.10448
Abstract
The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT format from various tensor inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT and its variants for streaming data, (3) Tucker2TT for Tucker format, and (4) TT-fADI for solutions of Sylvester tensor equations. We provide theoretical guarantees of accuracy, parallelization methods, scaling analysis, and numerical results. For example, for a -dimension tensor in , a two-sided sketching algorithm PSTT2 is shown to have a memory complexity of , improving upon from previous algorithms.
arXiv comment23 pages, 8 figures
References in corpus (5)
- Parallel Tensor Compression for Large-Scale Scientific Data
- Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures
- Exact NMR simulation of protein-size spin systems using tensor train formalism
- Tensor Random Projection for Low Memory Dimension Reduction
- Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions