Tensor-Train Decomposition
Ivan Valer'evich Oseledets · SIAM Journal on Scientific Computing · 2011
A simple nonrecursive form of the tensor decomposition in d dimensions is presented. It does not inherently suffer from the curse of dimensionality, it has asymptotically the same number of parameters as the canonical decomposition, but it is stable and its computation is based on low-rank approximation of auxiliary unfolding matrices. The new form gives a clear and convenient way to implement all basic operations efficiently. A fast rounding procedure is presented, as well as basic linear algebra operations. Examples showing the benefits of the decomposition are given, and the efficiency is demonstrated by the computation of the smallest eigenvalue of a 19-dimensional operator.
Cited by 2,636 works. doi:10.1137/090752286
Authors
References
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” Decomposition
- Tensor Decompositions and Applications
- Some Mathematical Notes on Three-Mode Factor Analysis
- Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis
- A Multilinear Singular Value Decomposition
- PARAFAC. Tutorial and applications
- On the Best Rank-1 and Rank-( R 1 , R 2 ,. . ., R N ) Approximation of Higher-Order Tensors
- When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem