Low-rank approximation of tensors
Shmuel Friedland, Venu Tammali

TL;DR
This paper surveys low-rank tensor approximation methods and introduces a new Newton-based algorithm for finding optimal low-rank tensor approximations, comparing it with existing techniques.
Contribution
It presents a novel Newton method for best tensor approximation and discusses variants of CUR-approximation for tensors, enhancing existing approaches.
Findings
Newton method effectively finds fixed points for tensor approximation
Comparison shows the new method's competitive performance
Survey consolidates existing low-rank tensor approximation techniques
Abstract
In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained via the singular value decomposition, which allows to compute best rank k-approximations. For very big matrices a low rank approximation using SVD is not computationally feasible. In this case different approximations are available. It seems that variants of CUR decomposition are most suitable. For d-mode tensors T with d>2, many generalizations of the singular value decomposition have been proposed to obtain low tensor rank decompositions. The most appropriate approximation seems to be best (r_1,...,r_d)-approximation, which maximizes the l_2 norm of the projection of T on a tensor product of subspaces U_1,...,U_d, where U_i is an r_i-dimensional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Statistical and numerical algorithms · Computational Physics and Python Applications
