Faster Tensor Train Decomposition for Sparse Data

by   Lingjie Li, et al.

In recent years, the application of tensors has become more widespread in fields that involve data analytics and numerical computation. Due to the explosive growth of data, low-rank tensor decompositions have become a powerful tool to harness the notorious curse of dimensionality. The main forms of tensor decomposition include CP decomposition, Tucker decomposition, tensor train (TT) decomposition, etc. Each of the existing TT decomposition algorithms, including the TT-SVD and randomized TT-SVD, is successful in the field, but neither can both accurately and efficiently decompose large-scale sparse tensors. Based on previous research, this paper proposes a new quasi-best fast TT decomposition algorithm for large-scale sparse tensors with proven correctness and for which the upper bound of its complexity derived. In numerical experiments, we verify that the proposed algorithm can decompose sparse tensors faster than the TT-SVD, and have more speed, precision and versatility than randomized TT-SVD, and it can be used to decomposes arbitrary high-dimensional tensor without losing efficiency when the number of non-zero elements is limited. The new algorithm implements a large-scale sparse matrix TT decomposition that was previously unachievable, enabling tensor decomposition based algorithms to be applied in larger-scale scenarios.


page 1

page 2

page 3

page 4


Computing low-rank approximations of large-scale matrices with the Tensor Network randomized SVD

We propose a new algorithm for the computation of a singular value decom...

Low-rank Tensor Train Decomposition Using TensorSketch

Tensor train decomposition is one of the most powerful approaches for pr...

Adaptive Cross Tubal Tensor Approximation

In this paper, we propose a new adaptive cross algorithm for computing a...

Shape Constrained Tensor Decompositions using Sparse Representations in Over-Complete Libraries

We consider N-way data arrays and low-rank tensor factorizations where t...

Randomized algorithms for low-rank tensor decompositions in the Tucker format

Many applications in data science and scientific computing involve large...

A randomized algorithm for the QR decomposition-based approximate SVD

Matrix decomposition is a very important mathematical tool in numerical ...

A Coupled Random Projection Approach to Large-Scale Canonical Polyadic Decomposition

We propose a novel algorithm for the computation of canonical polyadic d...

Please sign up or login with your details

Forgot password? Click here to reset