The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format

来自 Semantic Scholar

喜欢 0

阅读量：

520

作者：

S Holtz，T Rohwedder，R Schneider

展开

摘要：

Recent achievements in the field of tensor product approximation provide promising new formats for the representation of tensors in form of tree tensor networks. In contrast to the canonical r-term representation (CANDECOMP, PARAFAC), these new formats provide stable representations, while the amount of required data is only slightly larger. The tensor train (TT) format [SIAM J. Sci. Comput., 33 (2011), pp. 2295–2317], a simple special case of the hierarchical Tucker format [J. Fourier Anal. Appl., 5 (2009), p. 706], is a useful prototype for practical low-rank tensor representation. In this article, we show how optimization tasks can be treated in the TT format by a generalization of the well-known alternating least squares (ALS) algorithm and by a modified approach (MALS) that enables dynamical rank adaptation. A formulation of the component equations in terms of so-called retraction operators helps to show that many structural properties of the original problems transfer to the micro-iterations, giving...

展开

关键词：

density matrix renormalization group alternating least squares optimization problem iterative methods for linear systems eigenvalue problem tensor product approximation tensor decompositions tensor train high-dimensional systems matrix product states hierarchical tensors