Parallel Algorithms for Computing the Tensor-Train Decomposition
From MaRDI portal
Publication:6097870
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.
Recommendations
- Parallel Algorithms for Tensor Train Arithmetic
- Parallel Algorithms for Low Rank Tensor Arithmetic
- Tensor-train decomposition
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Efficient Tensor Decompositions
- Parallel approximation of multidimensional tensors using GPUs
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- scientific article; zbMATH DE number 4201470
- Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm
Cites work
- A literature survey of low-rank tensor approximation techniques
- A Multilinear Singular Value Decomposition
- Adaptive hierarchical subtensor partitioning for tensor compression
- Alternating minimal energy methods for linear systems in higher dimensions
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Computational Methods for Linear Matrix Equations
- Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
- Fast Poisson solvers for spectral methods
- Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the Fokker-Planck equation
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 2045481 (Why is no real title available?)
- scientific article; zbMATH DE number 5180707 (Why is no real title available?)
- Low-rank solution to an optimization problem constrained by the Navier-Stokes equations
- Low-Rank Tensor Approximation for High-Order Correlation Functions of Gaussian Random Fields
- Low-rank Tucker approximation of a tensor from streaming data
- MERACLE: constructive layer-wise conversion of a tensor train into a MERA
- On the ADI method for Sylvester equations
- On the Compressibility of Tensors
- On the singular values of matrices with high displacement rank
- Parallel Algorithms for Low Rank Tensor Arithmetic
- Parallel Algorithms for Tensor Train Arithmetic
- Randomized Algorithms for Rounding in the Tensor-Train Format
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Rang revealing QR factorizations
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
- Tensor-train decomposition
- TT-cross approximation for multidimensional arrays
- TT-GMRES: solution to a linear system in the structured tensor format
- TuckerMPI: a parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition
- Two-level QTT-Tucker format for optimized tensor calculus
Cited in
(23)- Faster tensor train decomposition for sparse data
- Parallel ALS algorithm for solving linear systems in the hierarchical Tucker representation
- On algorithms for and computing with the tensor ring decomposition
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Parallel Algorithms for Tensor Train Arithmetic
- Performance of the low-rank TT-SVD for large dense tensors on modern multicore CPUs
- Parallel Algorithms for Low Rank Tensor Arithmetic
- A TT-based hierarchical framework for decomposing high-order tensors
- Estimating a few extreme singular values and vectors for large-scale matrices in tensor train format
- Higher-Order QR with Tournament Pivoting for Tensor Compression
- Generative modeling via tensor train sketching
- Streaming Tensor Train Approximation
- Parallel approximation of multidimensional tensors using GPUs
- High-dimensional density estimation with tensorizing flow
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Parallel Randomized Tucker Decomposition Algorithms
- Denoising convolution algorithms and applications to SAR signal processing
- Efficient randomized algorithms for computing an approximation of the tensor train decomposition
- Randomized sketched TT-GMRES for linear systems with tensor structure
- Reduced-order modeling for uncertainty quantification of parameterized fluid-structure interaction problems
- An ADMM-based interior point method for solving nonnegative tensor least squares problems and its applications
- Parametric kernel low-rank approximations using tensor train decomposition
- A Block Tensor Train Burer-Monteiro Framework for Low-Rank Quantum State Tomography
This page was built for publication: Parallel Algorithms for Computing the Tensor-Train Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097870)
