Algebraic methods for tensor data
From MaRDI portal
Publication:5148409
Abstract: We develop algebraic methods for computations with tensor data. We give 3 applications: extracting features that are invariant under the orthogonal symmetries in each of the modes, approximation of the tensor spectral norm, and amplification of low rank tensor structure. We introduce colored Brauer diagrams, which are used for algebraic computations and in analyzing their computational complexity. We present numerical experiments whose results show that the performance of the alternating least square algorithm for the low rank approximation of tensors can be improved using tensor amplification.
Recommendations
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 1160038 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3032538 (Why is no real title available?)
- A Multilinear Singular Value Decomposition
- A Theory of Cross-Spaces. (AM-26)
- A concise proof to the spectral and nuclear norm bounds through tensor partitions
- Algebraic geometry IV: linear algebraic groups, invariant theory. Transl. from the Russian by G.A. Kandall
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- Exact matrix completion via convex optimization
- Most tensor problems are NP-hard
- Nuclear norm of higher-order tensors
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- On algebras which are connected with the semisimple continuous groups
- On tensor completion via nuclear norm minimization
- On the nuclear norm and the singular value decomposition of tensors
- Produits tensoriels topologiques et espaces nucléaires
- Rank-one approximation to high order tensors
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor rank is NP-complete
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication: Algebraic methods for tensor data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148409)