Randomized density matrix renormalization group algorithm for low-rank tensor train decomposition
Randomized density matrix renormalization group algorithm for low-rank tensor train decomposition
Huilin Jiang,Zhongming Chen,Gaohang Yu
TLDR
A novel randomized proximal DMRG algorithm for low-rank tensor train decomposition is proposed by using TensorSketch to alleviate the curse of dimensionality and demonstrate the effectiveness and efficiency of the proposed algorithm.
Abstract
Tensor train decomposition is a powerful tool for processing high-dimensional data. Density matrix renormalization group (DMRG) is an alternating scheme for low-rank tensor train decomposition of large tensors. However, it may suffer from the curse of dimensionality due to the large scale of subproblems. In this paper, we proposed a novel randomized proximal DMRG algorithm for low-rank tensor train decomposition by using TensorSketch to alleviate the curse of dimensionality. Numerical experiments on synthetic and real-world data also demonstrate the effectiveness and efficiency of the proposed algorithm.
